LeetCode 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.

题意：给出两个数组，求出公共集，元素要求唯一

代码如下：

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