LeetCode--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 =10unit.

For example,

Given height =[2,1,5,6,2,3],

return10.

class Solution {
public:
int largestRectangleArea(vector<int> &height)
{
int res = 0;
stack<int> si;
height.push_back(0);
for(int i = 0; i < height.size(); ++ i)
{
while(!si.empty() && height[si.top()] >= height[i])
{
int h = height[si.top()];
si.pop();

int s = h * (si.empty() ? i : (i - si.top() - 1));
res = max(res, s);
}
si.push(i);
}
return res;
}
};

这道题的相关分析及类似题型是：LeetCode--maximal-rectangle