栈 --- 4.1.3 Largest Rectangle in Histogram -- 图解

最新推荐文章于 2020-12-06 06:53:37 发布

alpha_2017

最新推荐文章于 2020-12-06 06:53:37 发布

阅读量180

点赞数 1

分类专栏：数据结构与算法

本文链接：https://blog.csdn.net/alpha_love/article/details/106975827

版权

数据结构与算法专栏收录该内容

37 篇文章 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.

图 4-1 Above is a histogram where width of each bar is 1, given height = [2,1,5,6,2,3]

图 4-2 the largest rectangle is shown in the shaded area, which has area = 10 unit.
For example, Given height = [2,1,5,6,2,3], return 10

**********************************************************************************************************/

class Solution{
public:
    int largestRectangleArea(vector<int>& height){
        stack<int > s;
        height.push_back(0);
        int result = 0;
        for(int i = 0; i < height.size();){
            if(s.empty() || height[i] > height[s.top()])
                s.push(i++);
            else{
                int tmp = s.top();
                s.pop();
                result = max(result, height[tmp] * (s.empty() ? i : i - s.top() - -1));
            }
        }
        return result;
    }
};