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.
Example:
Input: [2,1,5,6,2,3]
Output: 10
解题思路:
维护一个栈,用来保存递增序列。我们可以看到,直方图矩形面积要最大的话,需要尽可能的使得连续的矩形多,并且最