comefrom: <qiyuangong>560_Subarray_Sum_Equals_K_1.java
code: public int subarraySum(int[] nums, int k) {
          int count = 0;
          for (int start = 0; start < nums.length; start++) {
              int sum = 0;
              for (int end = start; end < nums.length; end++) {
                  sum += nums[end];
                  if (sum == k)
                      count++;
              }
          }
          return count;
      }
masked: public int sample_funcname ( int [ ] var_0 , int var_1 ) {
    int var_3 = 0 ;
    for ( int var_4 = 0 ;
    var_4 < var_0 . length ;
    var_4 ++ ) {
      int var_6 = 0 ;
      for ( int var_7 = var_4 ;
      var_7 < var_0 . length ;
      var_7 ++ ) {
        var_6 += var_0 [ var_7 ] ;
        if ( var_6 == var_1 ) var_3 ++ ;
      }
    }
    return var_3 ;
  }
  