LeetCode 349. 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].

public class Solution {
    public int[] intersection(int[] nums1, int[] nums2) {
        Set set = new HashSet<>();
		List list = new ArrayList<>();
		for(int i=0;i<nums1.length;i++)set.add(nums1[i]);
		for(int i=0;i<nums2.length;i++){
			if(set.contains(nums2[i])){
			    list.add(nums2[i]);
			    set.remove(nums2[i]);
			}
		}
	    int[] sum = new int[list.size()];
		for(int i=0;i<list.size();i++)sum[i] = (int) list.get(i);
		return sum;
    }
}