Leetcode 84

84.py

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