Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 209 with 15 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 209 # by problem number
lcpy gen -s minimum_size_subarray_sum # by problem name
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.
Input: target = 7, nums = [2,3,1,2,4,3]
Output: 2
Explanation: The subarray [4,3] has the minimal length under the problem constraint.
Input: target = 4, nums = [1,4,4]
Output: 1
Input: target = 11, nums = [1,1,1,1,1,1,1,1]
Output: 0
O(n) solution, try coding another solution of which the time complexity is O(n log(n)).
class Solution:
# Time: O(n)
# Space: O(1)
def min_sub_array_len(self, target: int, nums: list[int]) -> int:
left = 0
window_sum = 0
min_len = len(nums) + 1
for right in range(len(nums)):
window_sum += nums[right]
while window_sum >= target:
min_len = min(min_len, right - left + 1)
window_sum -= nums[left]
left += 1
return 0 if min_len > len(nums) else min_len
| Time | Space |
|---|---|
| O(n) | O(1) |