给定 n 个非负整数,用来表示柱状图中各个柱子的高度。每个柱子彼此相邻,且宽度为 1 。
求在该柱状图中,能够勾勒出来的矩形的最大面积。
以上是柱状图的示例,其中每个柱子的宽度为 1,给定的高度为 [2,1,5,6,2,3]。
图中阴影部分为所能勾勒出的最大矩形面积,其面积为 10 个单位。
示例:
输入: [2,1,5,6,2,3]
输出: 10
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/largest-rectangle-in-histogram
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
暴力解法:
class Solution {
public int largestRectangleArea(int[] heights) {
if(heights.length ==0){
return 0;
}
int maxResult = 0;
for(int i=0;i<heights.length;i++){
int minNum = Integer.MAX_VALUE;
for(int j=i;j<heights.length;j++){
minNum = Math.min(minNum,heights[j]);
maxResult = Math.max(maxResult,minNum*(j-i+1));
}
}
return maxResult;
}
}
分治:
class Solution {
public int largestRectangleArea(int[] heights) {
return fenzhi(heights,0,heights.length-1);
}
private int fenzhi(int[] heights,int left,int right){
if(left > right) return 0;
int index = left;
int min = heights[index];
for (int i = left; i <= right; i++) {
if(min > heights[i]){
min = heights[i];
index = i;
}
}
int cur = (right-left+1) * min;
return Math.max(Math.max(fenzhi(heights,left,index-1),fenzhi(heights,index+1,right
)),cur);
}
}
栈:
public class Solution {
public int largestRectangleArea(int[] heights) {
Stack < Integer > stack = new Stack < > ();
stack.push(-1);
int maxarea = 0;
for (int i = 0; i < heights.length; ++i) {
while (stack.peek() != -1 && heights[stack.peek()] >= heights[i])
maxarea = Math.max(maxarea, heights[stack.pop()] * (i - stack.peek() - 1));
stack.push(i);
}
while (stack.peek() != -1)
maxarea = Math.max(maxarea, heights[stack.pop()] * (heights.length - stack.peek() -1));
return maxarea;
}
}