public class Solution {
    public int[] intersection(int[] nums1, int[] nums2) {
        if(nums1.length==0||nums2.length==0){
            int[] fuck = new int[0];
            return fuck;
        }
        ArrayList<Integer>Temp = new ArrayList<Integer>();
        Arrays.sort(nums1);
        Arrays.sort(nums2);
        int i = -1;
        int temp = nums2[0]-1;
        do{
            i++;
            for(int j = 0;j<nums1.length;j++){
                if(nums2[i] == nums1[j]){
                    if(temp == nums2[i]){
                        continue;
                    }
                    temp = nums2[i];
                    Temp.add(temp);
                    break;
                }
                if(nums1[j]>nums2[i]){
                    break;
                }
            }
        }while(i<nums2.length-1);
        int l = Temp.size();
        int[] res = new int[l];
        for(int k =0;k<l;k++){
            res[k] = Temp.get(k);
        }
        return res;
    }
}