comefrom: <awangdev>Minimum Size Subarray Sum_2.java
code: public int minSubArrayLen(int s, int[] nums) {
          if (nums == null || nums.length == 0) {
              return 0;
          }
          int result = Integer.MAX_VALUE;
          for (int i = 0; i < nums.length - 1; i++) {
              int sum = nums[i];
              if (sum >= s) {
                  result = 1;
                  break;
              }
              for (int j = i + 1; j < nums.length; j++) {
                  if (j - i >= result) {
                      break;
                  }
                  sum += nums[j];
                  if (sum >= s) {
                      result = Math.min(result, j - i + 1);
                      break;
                  }
              }
          }
          return result == Integer.MAX_VALUE ? 0 : result;
      }
masked: public int sample_funcname ( int var_0 , int [ ] var_1 ) {
    if ( var_1 == null || var_1 . length == 0 ) {
      return 0 ;
    }
    int var_7 = Integer . MAX_VALUE ;
    for ( int var_8 = 0 ;
    var_8 < var_1 . length - 1 ;
    var_8 ++ ) {
      int var_10 = var_1 [ var_8 ] ;
      if ( var_10 >= var_0 ) {
        var_7 = 1 ;
        break ;
      }
      for ( int var_11 = var_8 + 1 ;
      var_11 < var_1 . length ;
      var_11 ++ ) {
        if ( var_11 - var_8 >= var_7 ) {
          break ;
        }
        var_10 += var_1 [ var_11 ] ;
        if ( var_10 >= var_0 ) {
          var_7 = Math . min ( var_7 , var_11 - var_8 + 1 ) ;
          break ;
        }
      }
    }
    return var_7 == Integer . MAX_VALUE ? 0 : var_7 ;
  }
  