Minimum Size Subarray Sum

Given an array of n positive integers and a positive integer s,find the minimal length of a subarray of which the sum ≥ s. If there isn't one, return 0 instead.题目是找到>=s的最小子数组长度

For example, given the array [2,3,1,2,4,3] and s = 7,
the subarray [4,3] has the minimal length under the problem constraint.

用两个指针解决

public int minSubArrayLen(int s, int[] nums) {        int start = 0;int end = 0;int sum = 0;int min = Integer.MAX_VALUE;while (start < nums.length && end < nums.length) {while (sum < s && end < nums.length) {sum += nums[end++];}while (sum >= s && start <= end) {min = Math.min(min, end - start);sum -= nums[start++];}}return min == Integer.MAX_VALUE ? 0 : min;    }

http://blog.csdn.net/xudli/article/details/45715257