Q209 长度最小的子数组

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

class Solution {
public:
    int minSubArrayLen(int target, vector<int>& nums) {
        int left = 0;//左指针
        int right = 0;//右指针
        int sz = nums.size();
        int res = sz+1;
        int sum = 0;
        while(right != sz){
            sum += nums[right];
            while(sum >= target){//注意,判断left移动是一个连续过程
                res = min(res , right-left+1);
                sum -= nums[left++];
            }
            right++;
        }
        if(res == sz+1){
            return 0;
        }else{
            return res;
        }
    }
};