Medium 209题 Minimum Size Subarray Sum

最新推荐文章于 2021-04-01 21:08:42 发布

brenda_zhao

最新推荐文章于 2021-04-01 21:08:42 发布

阅读量222

点赞数

分类专栏： leetcode medium

本文链接：https://blog.csdn.net/brenda_zhao/article/details/52726132

版权

leetcode medium 专栏收录该内容

66 篇文章 0 订阅

订阅专栏

Question:

Given an array of n positive integers and a positive integer s, find the minimal length of a subarray of which the sum ≥ s. If there isn't one, return 0 instead.

For example, given the array [2,3,1,2,4,3] and s = 7,
the subarray [4,3] has the minimal length under the problem constraint.

Solution:

public class Solution {
    public int minSubArrayLen(int s, int[] nums) {
        return solveN(s, nums);
    }
    
    private int solveN(int s, int[] nums) {
        int start = 0, end = 0, sum = 0, minLen = Integer.MAX_VALUE;
        int n=nums.length;
        while(end<=n-1)
        {
            while(end<=n-1&&sum<s) sum+=nums[end++];
            if(sum<s) break;
            while(start<end&&sum>=s) sum-=nums[start++];
            if(end-start+1<minLen) minLen=end-start+1;
        }
        return minLen == Integer.MAX_VALUE ? 0 : minLen;
    }
}

O(NLONGN)的解法还没看懂