349. Intersection of Two Arrays (Easy)

https://leetcode.com/problems/intersection-of-two-arrays/

Given two arrays, write a function to compute their intersection.

Example 1:

Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2]

Example 2:

Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [9,4]

Note:

  • Each element in the result must be unique.
  • The result can be in any order.

 

Solutions

class Solution {

    public int[] intersection(int[] nums1, int[] nums2) {

        Set<Integer> s1 = new HashSet<>();
        for (int i = 0; i < nums1.length; i++) {
            s1.add(nums1[i]);
        }

        Set<Integer> s2 = new HashSet<>();
        for (int i = 0; i < nums2.length; i++) {
            if (s1.contains(nums2[i])) {
                s2.add(nums2[i]);
            }
        }

        int[] ans = new int[s2.size()];
        int count = 0;
        for (Integer i : s2) {
            ans[count++] = i;
        }

        return ans;
    }
}

Incorrect Solutions

References

Copyright © iovi.com 2017 all right reserved,powered by GitbookLast Modification: 2020-03-22 00:40:18

results matching ""

    No results matching ""