力扣209. 长度最小的子数组

 

题目：【https://leetcode.cn/problems/minimum-size-subarray-sum/solutions/305704/chang-du-zui-xiao-de-zi-shu-zu-by-leetcode-solutio/?envType=study-plan-v2&envId=top-interview-150】

滑动窗口解法，正常思路想会不自觉完成这种解法

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