[leetcode] Minimum Size Subarray Sum

最新推荐文章于 2024-06-16 11:54:10 发布

原创最新推荐文章于 2024-06-16 11:54:10 发布 · 315 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

222 篇文章

订阅专栏

本文介绍了一个LeetCode上的经典算法问题：寻找给定数组中满足指定条件的最小子数组长度。通过对数组进行遍历并利用双指针技巧，实现了高效的算法解决方案。

From : https://leetcode.com/problems/minimum-size-subarray-sum/

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 n = nums.size();
        int result = n+1, sum = 0, left = 0, right = 0;
        while (right < n) {
            sum += nums[right];
            while (sum >= s) {
                if (right-left+1 < result) result = right-left+1;
                sum -= nums[left];
                left++;
            }           
            right++;
        }
        return (n && result<=n)*result; 
	}
};