LeetCode 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.
题意是给一个包含正整数的数组和一个整数s,从s中找出一个最小长度的子数组,其和>=s,返回此子数组元素的个数;若没有此子数组则返回0
解法一:思路:设定两个指针start和end来指向数组元素(end>=start),start和end之间的和就是所求的sum,求出start和end之间最少的元素,并且其和>=s即可。
时间复杂度为O(n)
int minSubArrayLen(int s, vector<int>& nums)
{
if (nums.size() == 0)
return 0;
int start = 0, end = 0, sum = 0, minLen = INT_MAX;
while (end < nums.size())
{
//累加,直到出现sum>=s
while (end < nums.size() && sum < s)
sum += nums[end++];
if (sum < s)
break;
//出现sum>=s,则移动start指针,使它出现sum<s,此时就是最小长度和>s
while (start < end && sum >= s)
sum -= nums[start++];
//更新最小长度
if (end - start + 1 < minLen)
minLen = end - start + 1;
}
return minLen == INT_MAX ? 0 : minLen;
}