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.
我写的代码,Time Limit Exceeded
class Solution {
public:
int largestRectangleArea(vector<int>& heights) {
long long res = 0;
vector<long long> t;
for (int i = 0; i<heights.size(); i++) {
t.push_back(heights[i]);
res = max(res, t[i]);
}
for (int i = 1; i<heights.size(); i++) {
for (int j = 0; j<heights.size() - i; j++) {
t[j] = (min(t[j], t[j + 1]))*(i + 1) / i;
res = max(res, t[j]);
}
}
return res;
}
};
分析,对于每一个heights[i],作为短板,它生成最大矩形框,只要从i出发分别向左右搜索,直到找到左右第一个比heights[i]小的索引l,和右边第一个比heights小的索引r 那么l和r之间就是我们要找到的最大矩阵框。
现在对heights进行遍历,将柱状图的大小从小到大的顺序,将索引压栈,那么对于栈顶元素来说(假设其索引为cur),他对应的r即为当前遍历的位置,他对应的l则时他的上一个进栈的索引(有可能栈为空,则这个索引为-1),这样,计算过的索引弹栈,最终得到结果,最后为了计算最后一个元素的生成矩阵,我们在heights的末尾插入0,方便计算。
别人的代码:
class Solution {
public :
int largestRectangleArea(vector<int>& heights){
heights.push_back(0);
int nSize = heights.size();
stack<int> index;
int maxSize = 0;
int i=0;
while(i<nSize)
{
if (index.empty()||heights[i]>heights[index.top()])
{
index.push(i);
i++;
}
else
{
int j = index.top();
index.pop();
maxSize = max(maxSize, heights[j]*(index.empty() ? i : (i - index.top() - 1) ));
}
}
return maxSize;
}
};