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 795 with 23 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 795 # by problem number
lcpy gen -s number_of_subarrays_with_bounded_maximum # by problem name
Input: nums = [2,1,4,3], left = 2, right = 3
Output: 3
Explanation: There are three subarrays that meet the requirements: [2], [2, 1], [3].
Input: nums = [2,9,2,5,6], left = 2, right = 8
Output: 7
1 <= nums.length <= 10^50 <= nums[i] <= 10^90 <= left <= right <= 10^9class Solution:
# Time: O(n)
# Space: O(1)
def num_subarray_bounded_max(self, nums: list[int], left: int, right: int) -> int:
def at_most(bound: int) -> int:
total = 0
run = 0
for value in nums:
run = run + 1 if value <= bound else 0
total += run
return total
return at_most(right) - at_most(left - 1)
| Time | Space |
|---|---|
| O(n) | O(1) |