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 962 with 15 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 962 # by problem number
lcpy gen -s maximum_width_ramp # by problem name
nums is a pair (i, j) for which i < j and nums[i] <= nums[j]. The width of such a ramp is j - i.
Given an integer array nums, return the maximum width of a ramp in nums. If there is no ramp in nums, return 0.
Input: nums = [6,0,8,2,1,5]
Output: 4
Explanation: The maximum width ramp is achieved at (i, j) = (1, 5): nums[1] = 0 and nums[5] = 5.
Input: nums = [9,8,1,0,1,9,4,0,4,1]
Output: 7
Explanation: The maximum width ramp is achieved at (i, j) = (2, 9): nums[2] = 1 and nums[9] = 1.
2 <= nums.length <= 5 * 10^40 <= nums[i] <= 5 * 10^4class Solution:
# Time: O(n)
# Space: O(n)
def max_width_ramp(self, nums: list[int]) -> int:
stack: list[int] = []
for i, num in enumerate(nums):
if not stack or num < nums[stack[-1]]:
stack.append(i)
width = 0
for j in range(len(nums) - 1, -1, -1):
while stack and nums[stack[-1]] <= nums[j]:
width = max(width, j - stack.pop())
return width
| Time | Space |
|---|---|
| O(n) | O(n) |