Given an array of positive integers nums
and a positive integer target
, return the minimal length of a
subarray
whose sum is greater than or equal to target
. If there is no such subarray, return 0
instead.
Example 1:
Input: target = 7, nums = [2,3,1,2,4,3] Output: 2 Explanation: The subarray [4,3] has the minimal length under the problem constraint.
Example 2:
Input: target = 4, nums = [1,4,4] Output: 1
Example 3:
Input: target = 11, nums = [1,1,1,1,1,1,1,1] Output: 0
class Solution {
public:
int minSubArrayLen(int target, vector<int>& nums) {
sort(nums.begin(),nums.end());
int length=0;
int target1=target;
int sign=nums.size()-1;
for(int i=nums.size()-1;i>=0;i--){
if(target1==nums[i]){
if(length==0)
return 1;
else{
return length+1;
}
}
if(target1<nums[i]){
if(length==0)
continue;
else{
i=sign-1;
sign--;
target1=target;
length=0;
continue;
}
}
if(target1>nums[i]){
length++;
target1-=nums[i];
continue;
}
}
if(target1==0)
return length;
else
return 0;
}
};
仅为代码留存使用,代码存在错误需要修正