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
.
将数组画成直方图,求其中面积最大的矩形的面积。一开始想着用动态规划先求i到j的最小值,然后求i到j的矩形面积,但这样算法时间复杂度是O(n^2),有点慢。后来看一下tag,说是用stack实现。然后就想到了用stack的方法。
stack保存着数组中升序的子序列。如果当前的数小于栈顶元素(保存栈顶元素为局部最高点),则出栈,直到栈顶元素比当前数小,这样就保证了栈是升序的。并且在出栈的时候计算出栈点到局部最高点的最大矩形的面积,同时更新最大值。注意数组最后加上个0,这是为了使得能使得全部出栈。还要考虑的是[1,10,3,3,3,1]这种情况下,如果只是简单的出栈,高为3的矩形就不能算上10处的3,也就是代表3 * 3 = 9,最后答案为10,这样就不对了。考虑到出栈的点就没用了,所以把最后出栈的点改成当前点的值,这样就能延长矩形,得到正确的答案。
代码:
class Solution
{
public:
int largestRectangleArea(vector<int>& heights)
{
int n = heights.size();
stack<int>stk;
int res = 0, top = 0, pre;
heights.push_back(0);
for(int i = 0; i <= n; ++i)
{
if(!stk.empty()) top = stk.top();
pre = i;
while(!stk.empty() && heights[i] < heights[stk.top()])
{
res = max(res, ((heights[stk.top()] ) * (top - stk.top() + 1)));
pre = stk.top();
stk.pop();
}
heights[pre] = heights[i];
if(pre != i) stk.push(pre);
stk.push(i);
}
return res;
}
};