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