Leetcode209——長度最小的子數組（雙指針問題）

題目鏈接：https://leetcode-cn.com/problems/minimum-size-subarray-sum/

思路：雙指針

首先兩個指針同時指向0位，beg，last

如果當前值之和大於等於s，則l循環減去nums[beg]，beg++

然後加上nums[last]，last++

class Solution {
public:
    int minSubArrayLen(int s, vector<int>& nums) {
        int len=nums.size();
        int beg=0,last=0;
        int result_min_len=INT_MAX;
        int ans=0;
        while(last<len)
        {
            ans+=nums[last];
                while(ans>=s)
                {
                    result_min_len=min(result_min_len,last-beg+1);
                    ans-=nums[beg];
                    beg++;
                    cout<<beg<<" "<<last<<" "<<ans<<endl;
                }
            // cout<<ans<<endl;
            last++;
        }
        return result_min_len==INT_MAX?0:result_min_len;
    }
};