Problem Description:
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.
Example:
Input: [2,1,5,6,2,3] Output: 10
Analysis:
本题的思路是使用动态规划算法,最直接的方法就是定义一个二维数组,然后遍历整个数组找到最后的答案,但是会出现超出内存限制;所以可以使用另外一种思路,就是使用一个一维数组来替代原来的二维数组。
下面是dp数组的取值方法,然后根据每个值之间的距离计算最后的面积大小,保留最大的面积值。
代码如下:
Code:
方法一(超出内存最大限制):
class Solution {
public int largestRectangleArea(int[] heights) {
int len = heights.length;
if(len < 1)
return 0;
int[][] dp = new int[len][len];
int maxValue = heights[0];
for(int i = 0; i < len; i++) {
dp[i][i] = heights[i];
maxValue = Math.max(maxValue, heights[i]);
}
for(int j = 1; j < len; j++) {
int cur = j;
for(int i = 0; i < len - j; i++) {
dp[i][j + i] = Math.min(dp[i][j + i - 1], dp[i + 1][j + i]);
maxValue = Math.max(maxValue, dp[i][j + i] * (j + 1));
//System.out.println(i + ", " + j + ": " + maxValue);
}
}
// for(int i = 0; i < len; i++) {
// for(int j = 0; j < len; j++) {
// System.out.print(dp[i][j] + ", ");
// }
// System.out.println();
// }
return maxValue;
}
}
方法二:
class Solution {
public int largestRectangleArea(int[] heights) {
int len = heights.length;
if(len < 1)
return 0;
int[] dp = new int[len];
int maxValue = heights[0];
for(int i = 0; i < len; i++) {
dp[i] = heights[i];
maxValue = Math.max(maxValue, heights[i]);
}
for(int j = 1; j < len; j++) {
int cur = j;
for(int i = 0; i < len - j; i++) {
dp[i] = Math.min(dp[i], dp[i + 1]);
maxValue = Math.max(maxValue, dp[i] * (j + 1));
}
}
return maxValue;
}
}