leetcode 84 找出最大矩形 和 leetcode 42 接雨水 相似,最大矩形是在枚举height时,向左向右扫最近一个小于当前height值的下标作为矩形的底边。通过维护一个单调递增栈,在枚举heights数组时,如果数值比栈顶高,就加入栈,继续向后扫。当数值比栈顶底,说明已经遇到了向右扫时的右边界。此时不断从栈中将数值取出来,并将取出之后的栈顶数值,作为左边界的值。将左右边界相减,并与栈顶元素的height相乘就是此时(取出的栈顶元素位置)最大的元素。相当于是固定height之后,找出最大的底边。
代码:
package pro82;
import java.util.Arrays;
import java.util.Stack;
public class Solution {
public int largestRectangleArea(int[] heights) {
int[] newHeights = new int[heights.length + 2];
for(int i = 0; i < heights.length; i++) {
newHeights[i + 1] = heights[i];
}
newHeights[0] = 0;
newHeights[heights.length + 1] = 0;
Stack<Integer> stack = new Stack<>();
int ans = 0;
for(int right = 0; right < newHeights.length; right++){
while(!stack.isEmpty() && newHeights[stack.peek()] > newHeights[right]) {
int cur = stack.pop();
int curH = newHeights[cur];
int rr = right - 1;
int ll = stack.peek();
ans = Integer.max(ans, curH * (rr - ll));
}
stack.add(right);
}
return ans;
}
public static void main(String[] argv) {
System.out.println(new Solution().largestRectangleArea(heights));
}
// public static int[] heights = new int[]{2,1,5,6,2,3};
public static int[] heights = new int[]{2,4};
// public static int[] heights = new int[]{2,1,2};
}