[Leetcode]209. Minimum Size Subarray Sum

最新推荐文章于 2025-12-06 07:43:37 发布

原创最新推荐文章于 2025-12-06 07:43:37 发布 · 281 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

LeetCode 专栏收录该内容

116 篇文章

订阅专栏

本文介绍了一种寻找具有最小长度且元素之和大于等于给定值s的子数组的方法。通过一个具体的例子进行说明，即在数组[2,3,1,2,4,3]中找到满足条件s=7的最小子数组。

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.

class Solution {
public:
    int minSubArrayLen(int s, vector<int>& nums) {
        int minlen = numeric_limits<int>::max();
        int start = -1;
        int sum = 0;
        for (int i = 0; i < nums.size(); ++i) {
            sum += nums[i];
            while (sum >= s) {
                minlen = min(minlen, i - start);
                sum -= nums[++start];
            }
        }
        if (minlen == INT_MAX)
            return 0;
        return minlen;
    }
};