LeetCode||84. Largest Rectangle in Histogram

Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.

Above is a histogram where width of each bar is 1, given height = [2,1,5,6,2,3].

The largest rectangle is shown in the shaded area, which has area = 10 unit.

For example,
Given heights = [2,1,5,6,2,3],
return 10.

利用栈制造一个升序的数组，计算数组中的面积，排除比较，获得最大值

class Solution(object):
    def largestRectangleArea(self, heights):
        """
        :type heights: List[int]
        :rtype: int
        """
        stack=[]
        i=0
        area=0
        while i<len(heights):
        	if stack==[] or heights[i]>heights[stack[len(stack)-1]]:
        		stack.append(i)
        	else:
        		curr=stack.pop()
        		width=i if stack==[] else i-stack[len(stack)-1]-1
        		area=max(area,width*heights[curr])
        		i-=1
        	i+=1
        while stack!=[]:
        	curr=stack.pop()
        	width=i if stack==[] else len(heights)-stack[len(stack)-1]-1
        	area=max(area,width*heights[curr])
        return area