2019-08-11 Intersection of Two Arrays

question

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.

Ideas

1.set去重
2.hash表

class Solution {
    public int[] intersection(int[] nums1, int[] nums2) {
        
          int[] less=nums1.lengthnums2.length?nums1:nums2 ;
            HashSet lessSet =new HashSet();
            for (int i = 0; i  moreSet =new HashSet();
            for(int i=0 ;i