leetcode209
思路

代码
#include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
int minSubArrayLen(int target, vector<int>& nums) {
long len = nums.size();
int left = 0;
int right = 0;
int min_len = -1;
int cur_sum = 0;
while(right <= len && min_len != 1){
if(cur_sum < target){
if(right >= len){
break;
}
cur_sum += nums[right];
right++;
}else{
if(right - left < min_len || min_len == -1){
min_len = right - left;
}
cur_sum -= nums[left];
left++;
}
}
if(min_len == -1){
return 0;
}else{
return min_len;
}
return min_len;
}
};
int main(){
vector<int> nums = {2,3,1,2,4,3};
vector<int> &nums_r =nums;
Solution s;
s.minSubArrayLen(7,nums_r);
return 0;
}