public class Solution {
public int minSubArrayLen(int s, int[] nums) {
if(nums.length==0||nums==null) return 0;
int i=0,j=0,sum=0,min=Integer.MAX_VALUE;
while(i<nums.length){
sum+=nums[i++];
while(sum>=s){
min=Math.min(min,i-j);
sum-=nums[j++];
}
}
return min==Integer.MAX_VALUE? 0:min;
}
}
Array 209. Minimum Size Subarray Sum Given an array of n ...
Array 209. Minimum Size Subarray Sum Given an array of n ...
LeetCode 209. Minimum Size Subarray Sum Description Given...
209. Minimum Size Subarray Sum Given an array of n positi...
209. Minimum Size Subarray Sum 左右两个指针维护一个窗口，停止条件是右边指针小于数组...
题目：求数组中和大于某数的最小子数组的长度Given an array of n positive integer...
这一题的思路是用两个指针来指示，start，end指针表示subarray,其中end指向subarray的后一位...
Given an array of n positive integers and a positive inte...
Given an array of n positive integers and a positive inte...
本文标题：209. Minimum Size Subarray Sum
本文链接：https://www.haomeiwen.com/subject/jefimttx.html
网友评论