Minimum Size Subarray Sum
Given an array of positive integers
nums and an integer target. Find the minimal length of a subarray whose sum is >= target. If none exists, return 0.Example 1
Input: target = 11, nums = [11]
Output: 1
Explanation: One element equals 11
Output: 1
Explanation: One element equals 11
Example 2
Input: target = 7, nums = [2, 3, 1, 2, 4, 3]
Output: 2
Explanation: The minimum subarray with sum >= 7 has length 2: [4, 3] or [3, 4]
Output: 2
Explanation: The minimum subarray with sum >= 7 has length 2: [4, 3] or [3, 4]
Line 1, Char 1