LeetCode单调栈84

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

Erin Wang

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

阅读量106

点赞数 1

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

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

版权

LeetCode 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

84柱状图中最大的矩形

class Solution:
    def largestRectangleArea(self, heights: List[int]) -> int:
        result = 0
        heights.insert(0, 0)
        heights.append(0)
        stack = [0]
        for i in range(1, len(heights)):
            if heights[i] > heights[stack[-1]]:
                stack.append(i)
            elif heights[i] == heights[stack[-1]]:
                stack.pop()
                stack.append(i)
            else:
                while len(stack) > 1 and heights[i] < heights[stack[-1]]:
                    h = heights[stack[-1]]
                    stack.pop()
                    w_left = stack[-1]
                    w = i - w_left - 1
                    result = max(result, h * w)
                stack.append(i)
        return result