题目描述
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 =10unit.
For example,
Given height =[2,1,5,6,2,3],
return10.
方法一:
动态规划:求以每一个height[i]为高的向左向右延伸的最大矩形面积,再求出其中的最大值。
public class Solution {
public int largestRectangleArea(int[] height) {
if(height == null||height.length == 0)
return 0;
//存放每一个height[i]的矩形面积
int[] area=new int[height.length];
for(int i=0;i<height.length;i++)
{
int curarea=height[i];
area[i]=height[i];
//向右边加
for(int j=i+1;j<height.length;j++)
{
if(height[j]<curarea)
break;
else
area[i]+=curarea;
}
//向左边加
for(int k=i-1;k>=0;k--)
{
if(height[k]<curarea)
break;
else
area[i]+=curarea;
}
}
//找出area[i]中最大的值
int max=0;
for(int i=0;i<area.length;i++)
{
if(area[i]>max)
max=area[i];
}
return max;
}
}
方法二:栈
http://www.cnblogs.com/ganganloveu/p/4148303.html
网上看到一种借助栈的做法,代码很漂亮,但是解释都非常模糊,我看懂之后,决定仔细描述思路如下:
1、如果已知height数组是升序的,应该怎么做?
比如1,2,5,7,8
那么就是(1*5) vs. (2*4) vs. (5*3) vs. (7*2) vs. (8*1)
也就是max(height[i]*(size-i))
2、使用栈的目的就是构造这样的升序序列,按照以上方法求解。
但是height本身不一定是升序的,应该怎样构建栈?
比如2,1,5,6,2,3
(1)2进栈。s={2}, result = 0
(2)1比2小,不满足升序条件,因此将2弹出,并记录当前结果为2*1=2。
将2替换为1重新进栈。s={1,1}, result = 2
(3)5比1大,满足升序条件,进栈。s={1,1,5},result = 2
(4)6比5大,满足升序条件,进栈。s={1,1,5,6},result = 2
(5)2比6小,不满足升序条件,因此将6弹出,并记录当前结果为6*1=6。s={1,1,5},result = 6
2比5小,不满足升序条件,因此将5弹出,并记录当前结果为5*2=10(因为已经弹出的5,6是升序的)。s={1,1},result = 10
2比1大,将弹出的5,6替换为2重新进栈。s={1,1,2,2,2},result = 10
(6)3比2大,满足升序条件,进栈。s={1,1,2,2,2,3},result = 10
栈构建完成,满足升序条件,因此按照升序处理办法得到上述的max(height[i]*(size-i))=max{3*1, 2*2, 2*3, 2*4, 1*5, 1*6}=8<10
综上所述,result=10
import java.util.*;
public class Solution {
public int largestRectangleArea(int[] height) {
if(height == null||height.length == 0)
return 0;
Stack<Integer> stack=new Stack();
int ret=0;
for(int i=0;i<height.length;i++)
{
if(stack.empty()||height[i]>=stack.peek())
{
stack.push(height[i]);
}
else
{
int count=0;
while(!stack.empty()&&stack.peek()>height[i])
{
count++;
ret=Math.max(ret,stack.peek()*count);
stack.pop();
}
while(count>0)
{
stack.push(height[i]);
count--;
}
stack.push(height[i]);
}
}
int count=1;
while(!stack.empty())
{
ret=Math.max(ret,stack.peek()*count);
stack.pop();
count++;
}
return ret;
}
}