209.长度最小的子数组

  

class Solution {
public:
    int minSubArrayLen(int s, vector<int>& nums) {
        if(nums.empty())
            return 0;
        int count = 0,
        tl = 0,
        bg = 0,
        mi = 10000;
        for(int i = 0; i < nums.size(); ++i) {
            tl += nums[i];
            ++count;
            while(tl >= s) {
                mi = min(mi, count);
                tl -= nums[bg];
                ++bg;
                --count;
            }
        }
        return mi == 10000 ? 0 : mi;
    }
};

Accepted

15/15 cases passed (4 ms)

Your runtime beats 99.85 % of cpp submissions

Your memory usage beats 5.09 % of cpp submissions (10.2 MB)