comefrom: <qiyuangong>560_Subarray_Sum_Equals_K_2.java
code: public int subarraySum(int[] nums, int k) {
          int count = 0, sum = 0;
          HashMap < Integer, Integer > map = new HashMap < > ();
          map.put(0, 1);
          for (int i = 0; i < nums.length; i++) {
              sum += nums[i];
              if (map.containsKey(sum - k))
                  count += map.get(sum - k);
              map.put(sum, map.getOrDefault(sum, 0) + 1);
          }
          return count;
      }
masked: public int sample_funcname ( int [ ] var_0 , int var_1 ) {
    int var_3 = 0 , var_4 = 0 ;
    HashMap < Integer , Integer > var_7 = new HashMap < > ( ) ;
    var_7 . put ( 0 , 1 ) ;
    for ( int var_10 = 0 ;
    var_10 < var_0 . length ;
    var_10 ++ ) {
      var_4 += var_0 [ var_10 ] ;
      if ( var_7 . containsKey ( var_4 - var_1 ) ) var_3 += var_7 . get ( var_4 - var_1 ) ;
      var_7 . put ( var_4 , var_7 . getOrDefault ( var_4 , 0 ) + 1 ) ;
    }
    return var_3 ;
  }
  