int largestRectangleArea(vector<int> &height)
{
if(height.size()==0)
return 0;
height.push_back(0);
stack<int> index;
int i,maxarea,area;
index.push(0);
maxarea = area = height[0];
i =1;
while(i< height.size())
{
if(index.empty() || (!index.empty() && height[i] > height[index.top()]))
{
index.push(i);
}
else
{
while(!index.empty() && height[index.top()] >= height[i])
{
int idx = index.top();index.pop();
int width = index.empty()? i :(i-index.top()-1);
area = width * height[idx];
maxarea = max(maxarea,area);
}
index.push(i);
}
i++;
}
return maxarea;
{
if(height.size()==0)
return 0;
height.push_back(0);
stack<int> index;
int i,maxarea,area;
index.push(0);
maxarea = area = height[0];
i =1;
while(i< height.size())
{
if(index.empty() || (!index.empty() && height[i] > height[index.top()]))
{
index.push(i);
}
else
{
while(!index.empty() && height[index.top()] >= height[i])
{
int idx = index.top();index.pop();
int width = index.empty()? i :(i-index.top()-1);
area = width * height[idx];
maxarea = max(maxarea,area);
}
index.push(i);
}
i++;
}
return maxarea;
}
思想 :在末尾补一个0元素.维护一个下标的栈,保证以栈中下标为元素的子数组单调不减少,栈顶的元素最大.扫描原数组,遇到比栈顶不小的元素下标入栈,遇到比栈顶小的回头算面积.由于最后一个元素永远最小,所以永远有比较所有面积的机会.