LeetCode单调栈503|42

最新推荐文章于 2024-06-06 11:58:07 发布

Erin Wang

最新推荐文章于 2024-06-06 11:58:07 发布

阅读量104

点赞数 2

分类专栏： LeetCode 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/ErinWang666/article/details/137127725

版权

LeetCode 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

503下一个更大元素II

class Solution:
    def nextGreaterElements(self, nums: List[int]) -> List[int]:
        result = [-1] * len(nums)
        stack = [0]
        for i in range(1, len(nums) * 2):
            if nums[i % len(nums)] <= nums[stack[-1]]:
                stack.append(i % len(nums))
            else:
                while stack and nums[i % len(nums)] > nums[stack[-1]]:
                    result[stack[-1]] = nums[i % len(nums)]
                    stack.pop()
                stack.append(i % len(nums))
        return result

42接雨水

class Solution:
    def trap(self, height: List[int]) -> int:
        result = 0
        stack = [0]
        for i in range(1, len(height)):
            if height[i] < height[stack[-1]]:
                stack.append(i)
            elif height[i] == height[stack[-1]]:
                stack.pop()
                stack.append(i)
            else:
                while stack and height[i] > height[stack[-1]]:
                    mid = height[stack[-1]]
                    stack.pop()
                    if stack:
                        height_left = height[stack[-1]]
                        h = min(height_left, height[i]) - mid
                        w = i - stack[-1] - 1
                        result += h * w
                stack.append(i)
        return result