【leetcode】209. Minimum Size Subarray Sum

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

lemonade13

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

阅读量71

点赞数

分类专栏： code

本文链接：https://blog.csdn.net/lemonade13/article/details/102748774

版权

code 专栏收录该内容

233 篇文章 0 订阅

订阅专栏

209. Minimum Size Subarray Sum

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

题目链接：https://leetcode.com/problems/minimum-size-subarray-sum/

解法：双指针-滑动窗口

class Solution {
public:
    int minSubArrayLen(int s, vector<int>& nums) {
        int len = nums.size();
        if(len<=0) return 0;
        int i=0, j=0, minl=INT_MAX, sum=nums[0];
        while(true){
            if(sum<s){
                if(j>=len-1) break;
                else{
                    sum+=nums[++j];
                }
            }else{
                if(j-i+1<minl){
                    minl = j-i+1;
                }
                sum -= nums[i++];
            }
        }
        return minl==INT_MAX?0:minl;
    }
};

tip：minl设成nums.size()+1即可