Leetcode no. 349

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.

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


阅读更多
个人分类: leetcode
上一篇Leetcode no. 131
下一篇Leetcode no. 350
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭