public int minSubArrayLen(int s, int[] nums) {
		if (nums.length == 0)
			return 0;
		int n = nums.length;
		int fast = 0, slow = 0, curSum = 0;
		int min = Integer.MAX_VALUE;
		while (fast < n) {
			while (curSum + nums[fast] >= s) {
				curSum = curSum - nums[slow];
				int count = fast - slow + 1;
				min = min < count ? min : count;
				slow++;
			}
			curSum = curSum + nums[fast];
			fast++;
		}
		return min == Integer.MAX_VALUE ? 0 : min;
	}