comefrom: <awangdev>Minimum Size Subarray Sum_1.java
code: public int minSubArrayLen(int s, int[] nums) {
          if (nums == null || nums.length == 0) {
              return 0;
          }
          int start, end, sum;
          start = end = sum = 0;
          int min = Integer.MAX_VALUE;
          while (end < nums.length) {
              while (sum < s && end < nums.length) {
                  sum += nums[end];
                  end++;
              }
              while (sum >= s && start >= 0) {
                  min = Math.min(min, end - start);
                  sum -= nums[start];
                  start++;
              }
          }
          return min == Integer.MAX_VALUE ? 0 : min;
      }
masked: public int sample_funcname ( int var_0 , int [ ] var_1 ) {
    if ( var_1 == null || var_1 . length == 0 ) {
      return 0 ;
    }
    int var_5 , var_6 , var_7 ;
    var_5 = var_6 = var_7 = 0 ;
    int min = Integer . MAX_VALUE ;
    while ( var_6 < var_1 . length ) {
      while ( var_7 < var_0 && var_6 < var_1 . length ) {
        var_7 += var_1 [ var_6 ] ;
        var_6 ++ ;
      }
      while ( var_7 >= var_0 && var_5 >= 0 ) {
        min = Math . min ( min , var_6 - var_5 ) ;
        var_7 -= var_1 [ var_5 ] ;
        var_5 ++ ;
      }
    }
    return min == Integer . MAX_VALUE ? 0 : min ;
  }
  