该题与Ch_02最长子序列类似,采用聪明算法,详情参考Ch_02最长子序列
题目:
Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous 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, int[] nums) {
// 找出元素之和满足条件的最小子串
// 如果这样的子串不存在则返回0
// 找出元素之和大于target条件的最小子串
// 如果这样的子串不存在则返回0
// 聪明算法,时间复杂度O(1),当发现start至i大于
//说明该串存在满足条件,start往后推
//res赋值比当前数组长度大,方便求最小值
int res=nums.length+1;
//开始下标
int start=0;
int sum=0;
for(int i=0;i<nums.length;i++){
sum+=nums[i];
//判断字串序列是否大于res
if(i-start>=res){
sum-=nums[start++];
}
//寻找小于条件字串(即将start后推)
while(sum>=s){
res=Math.min(res,i-start+1);//因为下标从0开始需要加1
//start往后推
sum-=nums[start++];
}
}
if(res==nums.length+1)return 0;
return res;
}
}