209. Minimum Size Subarray Sum

weixin_33711641

于 2019-06-29 11:58:56 发布

阅读量259

点赞数

原文链接：http://www.cnblogs.com/asuran/p/7797152.html

版权

class Solution {
    public int minSubArrayLen(int s, int[] nums) {
        int i=0;
        int j=0;
        int len= Integer.MAX_VALUE;
        int sum=0;
        while(j<=nums.length)
        {
            if(sum<s&&j<nums.length)
            {
                sum+=nums[j];
                j++;
            }
            else if(sum>=s)
            {
                len=Math.min(len, j-i);
                System.out.println(j-i);
                sum-=nums[i];
                i++;
            }
            else
                break;
        }
        return len==Integer.MAX_VALUE?0:len;
    }
}

转载于:https://www.cnblogs.com/asuran/p/7797152.html