Leetcode:Largest Rectangle in Histogram

此题最简单的解法就是找到一个高然后向两边遍历找到对应矩形.但是对于数据量很大的数据测试是跑不了的,所以需要一个更好的解法.

我们的目的是找到每一个高的左右边界.方法就是利用一个栈,每次遇到一个元素,如果它大于当前栈顶元素或者栈为空就将它压入栈,否则就将当前栈顶元素出栈,然后左边界是当前元素的位置,右边界则是下一个栈顶元素。这样就可以O(N)获得所有的面积。

class Solution():
    def largestRectangleArea(self, heights):
        maxs = 0
        reg = heights
        n = len(reg)
        i = 0
        record = set(heights)
        while i<n:
            h = reg[i]
            j1 = i
            while j1>=0 and reg[j1]>= h:
                j1-=1
            j2 = i
            while j2<n and reg[j2]>=h:
                j2+=1
            s = (j2-j1-1)*reg[i]
            maxs = max(s,maxs)
            k = i+1
            while k<n and reg[k]==reg[i]:k+=1
            i = k
        return maxs

class Solution():
    def largestRectangleArea(self, heights):
        i,maxs = 0,0
        s = []
        heights.append(0)
        while i< len(heights):
            if len(s)==0 or heights[i]>heights[s[-1]]:s.append(i);i+=1
            else:
                t = heights[s.pop()]
                maxs = max(maxs,t *(i if len(s)==0 else (i-s[-1]-1)))
        return maxs