【LeetCode】【滑动窗口】【双指针】长度最小的子数组

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