leetcode-day15:Intersection of Two Arrays(两个数组的交集)

349. Intersection of Two Arrays

哈希表：哈希值太大了，还是得用set

Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must be unique and you may return the result in any order.

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]
Explanation: [4,9] is also accepted.

Constraints:

1 <= nums1.length, nums2.length <= 1000
0 <= nums1[i], nums2[i] <= 1000

JAVA代码实现：

class Solution {
    public int[] intersection(int[] nums1, int[] nums2) {
        Set<Integer> set1 = new HashSet<>();
        Set<Integer> resultSet = new HashSet<>();
        
        for(int i=0;i<nums1.length;i++){
          set1.add(nums1[i]);
        }
        
       for(int i=0;i<nums2.length;i++){
          if(set1.contains(nums2[i])){
              resultSet.add(nums2[i]);
          }
        }
        
        int[] resultArray = new int[resultSet.size()];
        int index=0;
        for(int i:resultSet){
            resultArray[index++]=i;
        }
        
        return resultArray;
    }
}