两个数组的交集

package leetcode;

import java.util.HashSet;
/***
 * leetcode 349 两个数组的交集
 *
 * */
public class InsertSectionSolution {
    public int[] intersection(int[] nums1, int[] nums2) {
        HashSet<Integer> hashSet = new HashSet<>();
        HashSet<Integer> resultSet = new HashSet<>();

        for(int num : nums1){
            hashSet.add(num);
        }
        for(int i= 0; i< nums2.length; i++){
            if(hashSet.contains(nums2[i])){
               resultSet.add(nums2[i]);
            }
        }
        int[] result = new int[resultSet.size()];
        int index = 0;
        for(int num : resultSet){
            result[index++] = num;

        }
        return result;
    }
    public static void main(String[] args){
        int[] nums2={4,9,5};
        int[] nums1={9,4,9,8,4};
        int[] result = new InsertSectionSolution().intersection(nums1,nums2);
        for(int res: result){
            System.out.println(res);
        }
    }
}