刷题的时候发现搞不定
https://leetcode.com/problems/largest-rectangle-in-histogram/
看了好多文档发现写的都不是很清楚,后来终于想明白了。关键是方向啊。
源代码如下:(很多中文的文档上代码都有问题)
http://www.geeksforgeeks.org/largest-rectangle-under-histogram/
// The main function to find the maximum rectangular area under given
// histogram with n bars
int largestRectangleArea(vector<int>& height) {
// Create an empty stack. The stack holds indexes of hist[] array
// The bars stored in stack are always in increasing order of their
// heights.
stack<int> s;
int max_area = 0; // Initalize max area
int tp; // To store top of stack
int area_with_top; // To store area with top bar as the smallest bar
// Run through all bars of given histogram
int i = 0;
while (i < height.size())
{
// If this bar is higher than the bar on top stack, push it to stack
if (s.empty() || height[s.top()] <= height[i])
s.push(i++);
// If this bar is lower than top of stack, then calculate area of rectangle
// with stack top as the smallest (or minimum height) bar. 'i' is
// 'right index' for the top and element before top in stack is 'left index'
else
{
tp = s.top(); // store the top index
s.pop(); // pop the top
// Calculate the area with hist[tp] stack as smallest bar
area_with_top = height[tp] * (s.empty() ? i : i - s.top() - 1);
// update max area, if needed
if (max_area < area_with_top)
max_area = area_with_top;
}
}
// Now pop the remaining bars from stack and calculate area with every
// popped bar as the smallest bar
while (s.empty() == false)
{
tp = s.top();
s.pop();
area_with_top = height[tp] * (s.empty() ? i : i - s.top() - 1);
if (max_area < area_with_top)
max_area = area_with_top;
}
return max_area;
}
算法的原理是:寻找当前index下能扩展的最大面积。如果遇到减少的高度,就处理当前累计的。如图所示:
1,,4,5就留到最后处理了。其他过程中就处理了。
方向很重要!