Leetcode 349 Intersection of Two 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.

寻找两个数组中重叠的部分 数字不重复

使用接口set和list

public class Solution {
    public int[] intersection(int[] nums1, int[] nums2) {
        HashSet<Integer> set = new HashSet<Integer>();//hashset的特点 元素不重复
        for(int i=0;i<nums1.length;i++)
            set.add(nums1[i]); //遍历增加
        List<Integer> resultList = new ArrayList<Integer>();
        for (int i=0;i<nums2.length;i++)
            if(set.contains(nums2[i])){
                resultList.add(nums2[i]);
                set.remove(nums2[i]); //记得删除
            }
        int result[] = new int[resultList.size()];
        for(int i=0;i<resultList.size();i++)
            result[i]=resultList.get(i);
        return result;

    }
}