<qiyuangong>961_N-Repeated_Element_in_Size_2N_Array_1.java
public int repeatedNTimes(int[] A) {
        HashMap<Integer, Integer> hash = new HashMap<>();
        int ans = A[0];
        for (int n: A) {
            int count = hash.getOrDefault(n, 0) + 1;
            hash.put(n, count);
            if (count >= hash.get(ans)) ans = n;
        }
        return ans;
    }
public int sample_funcname ( int [ ] var_0 ) {
  HashMap < Integer , Integer > var_3 = new HashMap < > ( ) ;
  int var_5 = var_0 [ 0 ] ;
  for ( int var_6 : var_0 ) {
    int var_9 = var_3 . getOrDefault ( var_6 , 0 ) + 1 ;
    var_3 . put ( var_6 , var_9 ) ;
    if ( var_9 >= var_3 . get ( var_5 ) ) var_5 = var_6 ;
  }
  return var_5 ;
}
