Intersection of Two unsorted Arrays
Given two arrays, write a function to compute their intersection.
Example:
Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2].
Note:
- Each element in the result must be unique.
- The result can be in any order.
Analysis
Since the two arrays are unsorted, we can use HashSet to solve the problem easily.
We can also solve the problem by first sorting the two arrays, and using the algorithm of finding intersection of two sorted arrays.
[Read More...]