LeetCode:Intersection of Two Arrays

Intersection of Two Arrays

Total Accepted: 5682  Total Submissions: 12479  Difficulty: Easy

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.

Subscribe to see which companies asked this question

Hide Tags

  Binary Search Hash Table Two Pointers Sort

Hide Similar Problems

  (E) Intersection of Two Arrays II

思路：

使用Set，因为Set中不能有重复元素。

java code:

public class Solution {
    public int[] intersection(int[] nums1, int[] nums2) {
        
        int len1 = nums1.length,len2 = nums2.length;
        
        Set<Integer> set = new HashSet<Integer>();
        Set<Integer> interSet = new HashSet<Integer>();
        
        for(int i=0;i<len1;i++) {
            set.add(nums1[i]);
        }
        
        for(int i=0;i<len2;i++) {
            if(set.contains(nums2[i])) interSet.add(nums2[i]);
        }
        
        int[] ret = new int[interSet.size()];
        int cnt = 0;
        for(int num:interSet) {
            ret[cnt++] = num;
        }
        
        return ret;
        
    }
}