LeetCode 209. 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: [2,3,1,2,4,3],s = 7Output: 2
Explanation: the subarray [4,3] has the minimal length under the problem constraint.

方法：滑动窗口

设滑动窗口区间为nums[l...r]，初始时令l=0，r=-1，当[l..r]所指区间的子数组之和小于给定目标s时，不断令r++，扩展该区间，直到[l..r]所指区间的数列之和大于等于给定目标s，令l++，缩小该区间，比较此时该连续子数组长度是否最小，循环直到给定数组中只剩下2个元素为止。

class Solution {
public:
    int minSubArrayLen(int s, vector<int>& nums) {
        int l = 0,r = -1; // 滑动窗口区间为nums[l...r]
        int sum = 0;
        int res = nums.size() + 1; // 最小连续子数组长度
        while (l < nums.size())
        {
            if (r+1 < nums.size() && sum < s) sum += nums[++r];
            else sum -= nums[l++];
            if (sum >= s) res = min(res , r-l+1);
        }
        if (res == nums.size()+1) return 0;
        return res;
    }
};