Leetcode 84. Largest Rectangle in Histogram (Hard) (cpp)

最新推荐文章于 2022-03-15 18:41:53 发布

Niko_Ke

最新推荐文章于 2022-03-15 18:41:53 发布

阅读量336

点赞数

本文链接：https://blog.csdn.net/Niko_Ke/article/details/53727300

版权

C++ 同时被 3 个专栏收录

299 篇文章 0 订阅

订阅专栏

Leetcode C++

287 篇文章 0 订阅

订阅专栏

Leetcode Array

96 篇文章 0 订阅

订阅专栏

Leetcode 84. Largest Rectangle in Histogram (Hard) (cpp)

Tag: Array, Stack

Difficulty: Hard

/*

84. Largest Rectangle in Histogram (Hard)

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) {
		stack<int> s;
		int res = 0;
		for (int i = 0; i <= heights.size(); i++) {
			int cur = i == heights.size() ? 0 : heights[i];
			while (!s.empty() && cur <= heights[s.top()]) {
				int height = heights[s.top()];
				s.pop();
				int left = s.empty() ? 0 : s.top() + 1;
				res = max(res, height * (i - left));
			}
			s.push(i);
		}
		return res;
	}
};