首页 > 代码库 > Minimum Size Subarray Sum
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.
class Solution {public: int minSubArrayLen(int s, vector<int>& nums) { int size = nums.size(); int minLen = INT_MAX,sum=0; int firstPos = 0; for(int i=0;i<size;i++){ sum += nums[i]; while(sum >= s){ minLen = min(minLen,i-firstPos+1); sum -= nums[firstPos++]; } } if(minLen == INT_MAX){ return 0; }else{ return minLen; } }};
Minimum Size Subarray Sum
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。