Wrong Answer
Details 
Input
[1]
[1]
Output
[1,1]
Expected
[1]

class Solution {
    public int[] intersect(int[] nums1, int[] nums2) {
        
        for (int i = 0; i < nums1.length; i++) {
            for (int j = 0; j < nums2.length; j++) {     
                if (nums1.length == 0) 
                {
                    return nums1;
                }   
                if (nums2.length == 0) 
                {
                    return nums2;
                }   
                if (nums1[i] == nums2[j]) {
                    return new int[]  {nums2[i],nums2[j]};
                }
            }
        }
        return null;
    }
}