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.

 

 to see which companies asked this question

 

1 public class Solution { 2     public int[] intersection(int[] nums1, int[] nums2) { 3         int len1 = nums1.length, len2 = nums2.length; 4         Set
      
        set = new HashSet
       
        (); 5         Set
        
          set2 = new HashSet
         
          (); 6         for(int i = 0; i < len1; i++){ 7             set.add(nums1[i]); 8         } 9         for(int i = 0; i < len2; i++){10             if(set.contains(nums2[i])) set2.add(nums2[i]);11         }12         int[] res = new int[set2.size()];13         int index = 0;14         for(int ans : set2){15             res[index++] = ans;16         }17         return res;18     }19 }