[Leetcode] 209. Minimum Size Subarray Sum

link: https://leetcode.com/problems/minimum-size-subarray-sum/

Solution: 双指针
需要注意左边指针右移次数的判定

class Solution {
    public int minSubArrayLen(int s, int[] nums) {
        int sum = 0, cnt = Integer.MAX_VALUE, l = 0;
        for(int i=0; i<nums.length; i++) {
            sum += nums[i];
            while(sum >= s) {
                cnt = Math.min(cnt, i-l+1);
                sum -= nums[l];
                l++;
            }
        }
        return cnt == Integer.MAX_VALUE? 0 : cnt;
    }
}

TC: O(n)
SC: O(1)