209. 长度最小的子数组

https://leetcode.cn/problems/minimum-size-subarray-sum/description/

思路

使用滑动窗口的方法

code

class Solution {
public:
    int minSubArrayLen(int target, vector<int>& nums) {
        int n=nums.size();
        if(n==0) return 0;

        int sum=0;
        int MinLens=INT_MAX; //最小子数组长度
        int left=0,right =0;

        while(right<n){
            sum+=nums[right];
            while(sum>=target){
                MinLens=MinLens>(right-left+1)?(right-left+1):MinLens;
                sum-=nums[left++];
            }
            right++;
        }
        return MinLens==INT_MAX?0:MinLens;
    }
};