Steward

分享是一種喜悅、更是一種幸福

程式語言 - LeetCode - C++ - 209. Minimum Size Subarray Sum

---

參考資訊：
https://www.cnblogs.com/grandyang/p/4501934.html

題目：


解答：

class Solution {
public:
    int minSubArrayLen(int target, vector<int>& nums) {
        int l = 0;
        int ans = INT_MAX;
        int sum = 0;

        for (int r = 0; r < nums.size(); ++r) {
            sum += nums[r];

            while (sum >= target) {
                ans = min(ans, r - l + 1);
                sum -= nums[l];
                l += 1;
            }
        }

        return ans == INT_MAX ? 0 : ans;
    }
};