题解 | #长度最小的连续子数组#

#include <climits>
class Solution 
{
public:
    //滑动窗口
    int minSubarray(vector<int>& nums, int target) 
    {
        int n=nums.size();
        int left=0,right=0,sum=0,res=INT_MAX;
        for(right=0,left=0;right<n;right++)
        {
            sum+=nums[right];
            while(sum>=target)
            {
                res=min(res,right-left+1);
                sum-=nums[left];
                left++;
            }
        }
        return  res;
    }
};