comefrom: <qiyuangong>697_Degree_of_an_Array_1.java
code: public int findShortestSubArray(int[] nums) {
          Map<Integer, Integer> left = new HashMap(),
              right = new HashMap(), count = new HashMap();
  
          for (int i = 0; i < nums.length; i++) {
              int x = nums[i];
              if (left.get(x) == null) left.put(x, i);
              right.put(x, i);
              count.put(x, count.getOrDefault(x, 0) + 1);
          }
  
          int ans = nums.length;
          int degree = Collections.max(count.values());
          for (int x: count.keySet()) {
              if (count.get(x) == degree) {
                  ans = Math.min(ans, right.get(x) - left.get(x) + 1);
              }
          }
          return ans;
      }
masked: public int sample_funcname ( int [ ] var_0 ) {
    Map < Integer , Integer > var_1 = new HashMap ( ) , var_2 = new HashMap ( ) , var_3 = new HashMap ( ) ;
    for ( int var_4 = 0 ;
    var_4 < var_0 . length ;
    var_4 ++ ) {
      int var_5 = var_0 [ var_4 ] ;
      if ( var_1 . get ( var_5 ) == null ) var_1 . put ( var_5 , var_4 ) ;
      var_2 . put ( var_5 , var_4 ) ;
      var_3 . put ( var_5 , var_3 . getOrDefault ( var_5 , 0 ) + 1 ) ;
    }
    int var_6 = var_0 . length ;
    int var_7 = Collections . max ( var_3 . values ( ) ) ;
    for ( int var_5 : var_3 . keySet ( ) ) {
      if ( var_3 . get ( var_5 ) == var_7 ) {
        var_6 = Math . min ( var_6 , var_2 . get ( var_5 ) - var_1 . get ( var_5 ) + 1 ) ;
      }
    }
    return var_6 ;
  }
  