LeetCode 209. Minimum Size Subarray Sum

最新推荐文章于 2019-10-29 13:36:46 发布

develbai

最新推荐文章于 2019-10-29 13:36:46 发布

阅读量188

点赞数

分类专栏： LeetCode 文章标签： LeetCode Algorithm

本文链接：https://blog.csdn.net/master5512/article/details/79123769

版权

LeetCode 专栏收录该内容

21 篇文章 0 订阅

订阅专栏

LeetCode 209. Minimum Size Subarray Sum

Description

Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous 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.

    class Solution {
        public int minSubArrayLen(int s, int[] nums) {
            int i = 0, j = -1;
            int ans = nums.length + 1;
            int sum = 0;
            while (i < nums.length) {
                if(sum < s && j + 1 < nums.length) {
                    sum += nums[++j];
                }
                else {
                    sum -= nums[i++];
                }
                if(sum >= s) {
                    ans = Math.min(ans, j - i + 1);
                }
            }
            if (ans == nums.length + 1)
                return 0;
            return ans;
        }
    }