LeetCode 209. 长度最小的子数组

LeetCode 209. 长度最小的子数组

思路：

代码：

class Solution {
public:
    int minSubArrayLen(int target, vector<int>& nums) {
        int n = nums.size();
        int res = INT_MAX;
        for(int i = 0,j = 0,sum = 0;i < n;i++){
            sum += nums[i];
            while(sum - nums[j] >= target) sum -= nums[j++];
            if(sum >= target) res = min(res,i - j + 1);
        }
        if(res == INT_MAX) return 0;
        return res;
    }
};