Shortest Subarray with Sum at Least K
Given an integer array nums and an integer k, return the length of the shortest non-empty subarray of nums with a sum of at least k. If there is no such subarray, return -1.
A subarray is a contiguous part of an array.
Example 1
Input
nums = [1], k = 1Output
1The single element subarray [1] has sum 1, which is at least k.
Example 2
Input
nums = [1,2], k = 4Output
-1No non-empty contiguous subarray has a sum of at least 4.
Constraints
- 1 <= nums.length <= 10^5
- -10^5 <= nums[i] <= 10^5
- 1 <= k <= 10^9