80. Minimum Size Subarray Sum

Given positive integer target and positive integer array nums, return the minimal length of a subarray with sum >= target. If impossible, return 0.

Input: Positive integer target and positive integer array nums.

Output: Minimum subarray length or 0.

Examples

Input: 7,[2,3,1,2,4,3]
Output: 2
Explanation: [4,3] has sum 7, length 2.

Input: 4,[1,4,4]
Output: 1
Explanation: [4] has sum 4.

Input: 11,[1,1,1,1,1,1,1,1]
Output: 0
Explanation: Total sum 8 < 11.

Constraints

• 1<=target<=10^9
• 1<=nums.length<=10^5
• 1<=nums[i]<=10^4

Asked by