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.

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.

思路：题目要求是求在数组中的子数组的和大于给定值s的最小长度。

代码如下：

class Solution {
public:
    int minSubArrayLen(int s, vector<int>& nums) {
        //两个指针，起始都设置为0，一个负责向前加数据知直到大于s，一个从起始位置开始减数据，直到小于s，然后后面的那个指针再加数据。再数组和大于s的时候///统计下前后指针之间的距离，记录一个最小值就可以了
        int i=0,j=0;
        int sum=0;
        int minSize=INT_MAX;
        while(i<nums.size()&&j<nums.size())
        {
            while(sum<s&&j<nums.size())
                sum+=nums[j++];
            while(sum>=s&&i<nums.size())
            {
                minSize=minSize<(j-i)?minSize:j-i;
                sum-=nums[i++];
            }
        }
        return minSize==INT_MAX?0:minSize;
    }
};