LeetCode/Scripts/209.cpp at master · zzz0906/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
class Solution {
public:
    int sum(vector<int> l){
        int ans = 0;
        for (int i = 0; i < l.size(); i++)
            ans += l[i];
        return ans;
    }

    int minSubArrayLen(int s, vector<int>& nums) {
        if (nums.size() == 0) return 0;
        if (sum(nums) < s) return 0;
        int ans_len = INT_MAX;
        deque<int> ans;
        int current_sum = 0;
        for (int i = 0; i < nums.size(); i++){
            if (current_sum < s){
                ans.push_back(nums[i]);
                current_sum += nums[i];
            }
            else{
                ans_len = (ans_len < ans.size())?ans_len:ans.size();
                ans.push_back(nums[i]);
                current_sum += nums[i];
                while (current_sum - ans.front() >= s){
                    current_sum -= ans.front();
                    ans.pop_front();
                }
            }
        }
        if (current_sum >= s){
            while (current_sum - ans.front() >= s){
                    current_sum -= ans.front();
                    ans.pop_front();
                }
            ans_len = (ans_len < ans.size())?ans_len:ans.size();
        }
        return ans_len;
    }
};