Minimum Size Subarray Sum
Given an array of positive integers nums and a positive integer target, return the minimal length of a subarray whose sum is greater than or equal to target. If there is no such subarray, return 0 instead.
Follow up: If you have figured out the O(n) solution, try coding another solution whose time complexity is O(n log(n)).
Example 1
Input
target = 7, nums = [2,3,1,2,4,3]Output
2The subarray [4, 3] has the minimal length under the problem constraint.
Example 2
Input
target = 4, nums = [1,4,4]Output
1The single-element subarray [4] has a sum greater than or equal to 4, so the minimal length is 1.
Constraints
- 1 <= target <= 10^9
- 1 <= nums.length <= 10^5
- 1 <= nums[i] <= 10^4