209. Minimum Size Subarray Sum

最新推荐文章于 2024-09-02 14:20:50 发布

林下溪源

最新推荐文章于 2024-09-02 14:20:50 发布

阅读量83

点赞数

分类专栏： LeetCode # Arrays 文章标签： LeetCode 算法 Java

本文链接：https://blog.csdn.net/zzyy17/article/details/102978230

版权

LeetCode 同时被 2 个专栏收录

117 篇文章 0 订阅

订阅专栏

Arrays

79 篇文章 0 订阅

订阅专栏

Problem 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.

Example:
Input: s = 7, nums = [2,3,1,2,4,3]
Output: 2
Explanation: the subarray [4,3] has the minimal length under the problem constraint.
Follow up:

If you have figured out the O(n) solution, try coding another solution of which the time complexity is O(n log n).

Analysis:
本题的遍历一遍数组，每次当当前的数组和大于等于目标值s的时候，就对当前的数组值进行修剪，然后找到最小的数字序列大小。代码如下：

Code:

class Solution {
    public int minSubArrayLen(int s, int[] nums) {
        int start = 0, end = 0;
        int sumValue = 0;
        int minValue = nums.length + 1;
        for(end = 0; end < nums.length; end++) {
            sumValue += nums[end];
            if(sumValue < s) continue;
            while(sumValue >= s && start <= end) {
                minValue = Math.min(minValue, end - start + 1);
                sumValue -= nums[start];
                start++;
            }
            
        }
        return minValue == nums.length + 1 ? 0 : minValue;
    }
}