209. 长度最小的子数组（滑动窗口）

一、题目

209. 长度最小的子数组 - 力扣（LeetCode）

 

二、代码

class Solution {
public:
    int minSubArrayLen(int target, vector& nums) {
        int left = 0, right = 0;
        int sum = nums[right];
        int MinLength = INT_MAX;
        while (left = target)
            {
                MinLength = min(MinLength,right-left+1);
                sum -= nums[left];
                ++left;
            }
        }
        return MinLength== INT_MAX? 0 : MinLength;
    }
};