题解 | #长度最小的连续子数组#

class Solution {
public:
    int minSubarray(vector<int>& nums, int target) {
        int min=1e5,sum=0,count=0,n=nums.size();
        for(int i=0;i<n;i++){
            count=0;sum=0;
          for(int j=i;j<n;j++){
                 sum=sum+nums[j];count++;
                 if(sum>=target){
                      if(count<min)min=count;
                 }
           }
        }
        return min;
    }
};