【leetcode 滑动窗口 C++】209. Minimum Size Subarray Sum

209. Minimum Size Subarray Sum

class Solution {
    
    
public:
    int minSubArrayLen(int target, vector<int>& nums) {
    
    
        int l = 0, r = 1;
        int ans = INT_MAX;
        int sum = nums[0];
        while(r <= nums.size()) {
    
    
            while(l < nums.size() && sum - nums[l] >= target) sum -= nums[l++];
            if(sum >= target) ans = min(ans, r - l);
            if(r < nums.size()) sum += nums[r];
            r++;
        }
        return ans == INT_MAX ? 0 : ans;
    }
};