209. Minimum Size Subarray Sum

209. 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.

Hide Tags

Array Two Pointers Binary Search

Hide Similar Problems

(H) Minimum Window Substring (M) Maximum Size Subarray Sum Equals k

public class Solution {
public int minSubArrayLen(int s, int[] nums) {
int sum = 0;
int ret = Integer.MAX_VALUE;

int begin = 0;
int end = 0;
while(end<nums.length)
{
sum += nums[end++];
while(sum >= s){
ret = Math.min(ret, end - begin);
sum -= nums[begin++];
}
}

return ret == Integer.MAX_VALUE ? 0 : ret;
}
}