comefrom: <awangdev>349. Intersection of Two Arrays_1.java
code: public int[] intersection(int[] nums1, int[] nums2) {
          Set<Integer> set = new HashSet<>();
          for (int num : nums1) set.add(num);
          Set<Integer> rst = new HashSet<>();
          for (int num: nums2) {
              if (set.contains(num)) rst.add(num);
          }
          int i = 0;
          int[] result = new int[rst.size()];
          for (int num : rst) result[i++] = num;
          return result;
      }
masked: public int [ ] sample_funcname ( int [ ] var_0 , int [ ] var_1 ) {
    Set < Integer > var_2 = new HashSet < > ( ) ;
    for ( int var_3 : var_0 ) var_2 . add ( var_3 ) ;
    Set < Integer > var_4 = new HashSet < > ( ) ;
    for ( int var_3 : var_1 ) {
      if ( var_2 . contains ( var_3 ) ) var_4 . add ( var_3 ) ;
    }
    int var_5 = 0 ;
    int [ ] var_6 = new int [ var_4 . size ( ) ] ;
    for ( int var_3 : var_4 ) var_6 [ var_5 ++ ] = var_3 ;
    return var_6 ;
  }
  