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.
思路
用left指针指向子数组首位,每次遇到sum>=target时,计算子数组长度,并保留长度更小的一个。同时减去子数组首位,以缩短子数组长度。
复杂度 O(n) O ( n )
代码
class Solution {
public:
//一旦满足sum>=s的条件就停止计算,如果按照遍历的方法,则是O(N^2)
// 设置一个left和一个right指针 每次遇到sum>target 就记录当前子串长度,并减掉子串首后,继续判断与target的关系
int minSubArrayLen(int s, vector<int>& nums) {
int n=nums.size();
int left =0;
int sum=0;
int res=INT_MAX;
for(int i=0;i<n;++i){
sum+=nums[i];
while(sum>=s && left<=i){
res = min(i-left+1,res);
sum -= nums[left++];
}
}
return res==INT_MAX?0:res;
}
};