LeetCode209:长度最小的子数组

class Solution {
    public int minSubArrayLen(int s, int[] nums) {
        int n = nums.length;
        if(n == 0){
            return 0;
        }
        int left = 0,right = 0;
        int min = Integer.MAX_VALUE;
        int sum = 0;
        while(right < n){
            sum += nums[right];
            right++;
            while(sum>=s){
                min=Math.min(min,right-left);
                sum-=nums[left];
                left++;
            }
        }
        return min == Integer.MAX_VALUE?0:min;
    }
}