Minimum Size Subarray in Infinite Array
You are given a 0-indexed array nums and an integer target.
A 0-indexed array infinite_nums is generated by infinitely appending the elements of nums to itself.
Return the length of the shortest subarray of the array infinite_nums with a sum equal to target. If there is no such subarray, return -1.
Example 1
Input
nums = [1,2,3], target = 5Output
2The subarray in the range [1,2] has sum 5 and length 2, which is the shortest possible.
Example 2
Input
nums = [1,1,1,2,3], target = 4Output
2The subarray in the range [4,5] has sum 4 and length 2, which is the shortest possible.
Constraints
- 1 <= nums.length <= 10^5
- 1 <= nums[i] <= 10^5
- 1 <= target <= 10^9