LeetCode 84. Largest Rectangle in Histogram

最新推荐文章于 2024-01-26 10:15:16 发布

「已注销」

最新推荐文章于 2024-01-26 10:15:16 发布

阅读量447

点赞数 1

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/sunao2002002/article/details/52893452

版权

LeetCode 专栏收录该内容

80 篇文章 0 订阅

订阅专栏

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.

参考(知其所以然之永不遗忘的算法)[http://blog.jobbole.com/106819/]的分析，代码如下：

class Solution {
public:
int largestRectangleArea(vector<int>& heights) {
        vector<int> h(heights.begin(), heights.end());
        h.push_back(0);
        int maxSize = h[0];
        stack<int> iStack;
        int i = 0;
        while(i < h.size()){
            int curHeight = h[i];
            if(iStack.empty() || (curHeight > h[iStack.top()])){
                iStack.push(i++);
            }else{
                int barHeight = h[iStack.top()];
                iStack.pop();
                int width = (iStack.empty() ? i: i-iStack.top()-1);
                maxSize = max(maxSize,barHeight* width);
            }
        }
        return maxSize;
    }
};