fixing ArrayIntersection

teehill · teehill · commit f593855ca632 · 2023-04-04T23:34:52.000-07:00
diff --git a/Algorithms/LeetCode/ArrayIntersection.cs b/Algorithms/LeetCode/ArrayIntersection.cs
@@ -8,20 +8,18 @@ public static class ArrayIntersection
         public static int[] Intersection(int[] nums1, int[] nums2)
         {
             var intersection = new List<int>();
-            var nums1set = new HashSet<int>(nums1);
-            var nums2set = new HashSet<int>(nums2);
 
             HashSet<int> larger, smaller;
 
-            if (nums1set.Count() > nums1set.Count())
+            if (nums1.Count() > nums2.Count())
             {
-                larger = nums1set;
-                smaller = nums2set;
+                larger = new HashSet<int>(nums1);
+                smaller = new HashSet<int>(nums2);
             }
             else
             {
-                larger = nums2set;
-                smaller = nums1set;
+                larger = new HashSet<int>(nums2);
+                smaller = new HashSet<int>(nums1);
             }
 
             foreach (var smallValue in smaller)

Original file line number	Diff line number	Diff line change
`@@ -8,20 +8,18 @@ public static class ArrayIntersection`
`8`	`8`	`public static int[] Intersection(int[] nums1, int[] nums2)`
`9`	`9`	`{`
`10`	`10`	`var intersection = new List<int>();`
`11`		`- var nums1set = new HashSet<int>(nums1);`
`12`		`- var nums2set = new HashSet<int>(nums2);`
`13`	`11`
`14`	`12`	`HashSet<int> larger, smaller;`
`15`	`13`
`16`		`- if (nums1set.Count() > nums1set.Count())`
	`14`	`+ if (nums1.Count() > nums2.Count())`
`17`	`15`	`{`
`18`		`- larger = nums1set;`
`19`		`- smaller = nums2set;`
	`16`	`+ larger = new HashSet<int>(nums1);`
	`17`	`+ smaller = new HashSet<int>(nums2);`
`20`	`18`	`}`
`21`	`19`	`else`
`22`	`20`	`{`
`23`		`- larger = nums2set;`
`24`		`- smaller = nums1set;`
	`21`	`+ larger = new HashSet<int>(nums2);`
	`22`	`+ smaller = new HashSet<int>(nums1);`
`25`	`23`	`}`
`26`	`24`
`27`	`25`	`foreach (var smallValue in smaller)`