leetcode---largest-rectangle-in-histogram---栈

最新推荐文章于 2019-07-03 14:45:00 发布

谛听-

最新推荐文章于 2019-07-03 14:45:00 发布

阅读量255

点赞数

CC 4.0 BY-SA版权

分类专栏：题

本文链接：https://blog.youkuaiyun.com/u012319493/article/details/79121601

题专栏收录该内容

456 篇文章

订阅专栏

本文介绍了一种求解直方图中最大矩形面积的高效算法。通过使用栈来跟踪直方图条的高度，该算法能够在线性时间内找到具有最大面积的矩形。示例代码展示了如何处理输入数据并返回最大面积。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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) 
    {
        stack<int> s;
        int ans = 0;

        for(int i=0; i<height.size(); i++)
        {
            int cnt = 0;
            if(s.empty() || s.top() <= height[i])
            {
                s.push(height[i]);
            }
            else
            {
                while(!s.empty() && s.top() > height[i])
                {
                    ++cnt;
                    ans = max(ans, cnt * s.top());
                    s.pop();
                }
                while(cnt--)
                    s.push(height[i]);
                s.push(height[i]);
            }
        }

        int cnt = 1;
        while(!s.empty())
        {
            ans = max(ans, cnt * s.top());
            ++cnt;
            s.pop();
        }
        return ans;
    }
};