LeetCode-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) {
        int l1=nums1.length;
        int l2=nums2.length;
        
        Set<Integer> set=new HashSet<Integer>();
        for(int i=0; i<l1; i++){
            set.add(nums1[i]);
        }
        Set<Integer> resSet=new HashSet<Integer>();
        for(int i=0; i<l2; i++){
            if(set.contains(nums2[i])){
                resSet.add(nums2[i]);
            }
        }
        
        int[] a=new int[resSet.size()];
        /*
        for(int i=0; i<resSet.size(); i++){
            a[i]=resSet.get(i);
        }
        */
        int i=0;
        for(int j : resSet){
            a[i]=j;
            i++;
        }
        return a;
    }
}