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.
The largest rectangle is shown in the shaded area, which has area =10
unit.
For example,Given heights =[2,1,5,6,2,3],return10.

class Solution {
public:
    int largestRectangleArea(vector<int>& heights) {
        stack<int> s;
        heights.push_back(0);
        int result = 0;
        for(int i=0;i<heights.size();)
        {
            if(s.empty()||heights[i]>heights[s.top()])
                s.push(i++);
            else
              {
                  int temp = s.top();
                  s.pop();
                  result = max(result,heights[temp]*(s.empty() ? i:i-s.top()-1));
              }
        }
        return result;
    }
};
最后编辑于
©著作权归作者所有,转载或内容合作请联系作者
【社区内容提示】社区部分内容疑似由AI辅助生成,浏览时请结合常识与多方信息审慎甄别。
平台声明:文章内容(如有图片或视频亦包括在内)由作者上传并发布,文章内容仅代表作者本人观点,简书系信息发布平台,仅提供信息存储服务。

相关阅读更多精彩内容

友情链接更多精彩内容