(Easy) Intersection of Two Arrays LeetCode

import java.util.*;

class Solution {
    public int[] intersection(int[] nums1, int[] nums2) {
    
      Set<Integer> set1 = new HashSet<Integer>();
    
      int len = nums1.length> nums2.length? nums2.length:nums1.length;
    
    int[] tmp_result = new int[len];
        
      for(int num: nums2){
          set1.add(num);
          
      }
        int k = 0;
        for(int num: nums1){
            
            if(set1.contains(num)){
                
                tmp_result[k++] = num;
                set1.remove(num);
            }
        }
          
        return Arrays.copyOf(tmp_result,k);   
    }
    
    
}