Minimum Size Subarray Sum

Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn’t one, return 0 instead.

Example:

Input: s = 7, nums = [2,3,1,2,4,3]
Output: 2
Explanation: the subarray [4,3] has the minimal length under the problem constraint.
Follow up:
If you have figured out the O(n) solution, try coding another solution of which the time complexity is O(n log n).

O(n)解法
用两个指针l，r指向子数组的始末位置，当sum>=s时候开始向右移动l，并不断更新最短长度len,直到sum<s

int minSubArrayLen(int s, vector<int>& nums) {
        
        int len=INT_MAX,sum=0,l=0,r=0;
        while(sum<s&&r<nums.size())
        {
            sum +=nums[r++];
            while(sum>=s)
            {
                len = min(len,r-l);
                sum -= nums[l++];
            }
        }
        return len==INT_MAX?0:len;
    }