547. 两数组的交

题目描述

返回两个数组的交
注意事项
Each element in the result must be unique.
The result can be in any order.

样例
nums1 = [1, 2, 2, 1], nums2 = [2, 2], 返回 [2].

---

用Hashset实现即可

public class Solution {

    /*
     * @param nums1: an integer array
     * @param nums2: an integer array
     * @return: an integer array
     */
    public int[] intersection(int[] nums1, int[] nums2) {
        // write your code here
        Set<Integer> set = new HashSet<>();
        Set<Integer> res = new HashSet<>();
        for (int i:nums1) {
            set.add(i);
        }
        for (int i:nums2) {
            if (set.contains(i)){
                res.add(i);
            }
        }
        int[] result=new int[res.size()];
        int n=0;
        for (Integer i:res) {
            result[n]=i;
            n++;
        }

        return result;
    }
}