#数组 #长度最小的子数组 #leetcode

minimum-size-subarray-sum-209.cpp

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