【LeetCode】Minimum Size Subarray Sum

采用类似滑动窗口的形式，双指针i,j，复杂度O(n).

与https://leetcode.com/problems/minimum-window-substring/  这题有点类似

public class Solution {
    public int minSubArrayLen(int s, int[] nums) {
        if(nums == null || nums.length == 0) return 0;
        int res = Integer.MAX_VALUE;
        int sum = 0, i = 0, j = 0;
        while(i <= j && j < nums.length && sum < s){
            sum += nums[j];
            while(i <= j && sum >= s){
                res = Math.min(res, j - i + 1);
                sum -=nums[i];
                i ++;
            }
            j ++;
        }
        return (res == Integer.MAX_VALUE ? 0 : res);
    }
}