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

        int left = 0, right = 0;
        int localSum = nums[left];
        while (right < nums.size()) {
            if (localSum >= target) {
                ans = min(ans, right - left + 1);
                localSum -= nums[left];
                left++;
            }
            else {
                right++;

                if (right == nums.size())
                    if (ans == INT_MAX)
                        return 0;
                    else
                        return ans;
                localSum += nums[right];
            }
        }

        return ans;
    }
};