349. intersection of two arrays

class  {
    public int[] intersection(int[] nums1, int[] nums2) {
        List<Integer> list = new ArrayList<>();
    int[] nums = null;
     if (nums1 == null || nums2 == null || nums1.length == 0 || nums2.length == 0) {
           nums = new int[0];
         return nums;
    }
    for (int i = 0; i < nums1.length; i++) {
        for (int j = 0; j < nums2.length; j++) {
               if (nums1[i] == nums2[j]) {
                     if (!list.contains(nums1[i])) {
                         list.add(nums1[i]);
                      }
                }
         }
    }
    int size = list.size();
     nums = new int[size];
      for (int i = 0; i < size; i++) {
        nums[i] = list.get(i);
       }
    return nums;
    }
}