Largest Rectangle in Histogram
Posted wxquare的学习笔记
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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.
For example,
Given heights = [2,1,5,6,2,3]
,
return 10
.
class Solution { public: int largestRectangleArea(vector<int>& heights) { heights.push_back(0); stack<int> s; int res = 0; int i = 0; while(i < heights.size()){ if(s.empty() || heights[i] > heights[s.top()]){ s.push(i); i++; }else{ int cur = s.top(); s.pop(); if(s.empty()){ res = max(res,heights[cur]*i); }else{ res = max(res,heights[cur]*(i-s.top()-1)); } } } return res; } };
以上是关于Largest Rectangle in Histogram的主要内容,如果未能解决你的问题,请参考以下文章
Largest Rectangle in Histogram
Largest Rectangle in Histogram
Largest Rectangle in Histogram
Largest Rectangle in a Histogram
84. Largest Rectangle in Histogram
84. Largest Rectangle in Histogram *HARD* 柱状图求最大面积 85. Maximal Rectangle *HARD*