集合 05 Leetcode中的349号问题

349. 两个数组的交集

class Solution {
    
    public int[] intersection(int[] nums1, int[] nums2) {
        TreeSet set = new TreeSet();
        for (int num : nums1) {
            set.add(num);
        }

        ArrayList list = new ArrayList<>();
        for (int num : nums2) {
            if (set.contains(num)) {
                list.add(num);
                set.remove(num);
            }
        }

        int[] res = new int[list.size()];
        for (int i = 0; i < list.size(); i++) {
            res[i] = list.get(i);
        }
        return res;
    }
    
}