https://leetcode.com/problems/largest-rectangle-in-histogram/
public class Solution { public int largestRectangleArea(int[] heights) { int result = 0; Stack<Integer> stack = new Stack<>(); for (int i = 0; i < heights.length; i++) { while (!stack.isEmpty() && heights[stack.peek()] >= heights[i]) { int tmp = stack.pop(); int height = heights[tmp]; int width = stack.isEmpty() ? i : i - stack.peek() - 1; result = Math.max(result, height * width); } stack.push(i); } // process the numbers left in stack while (!stack.isEmpty() && heights[stack.peek()] >= 0) { int tmp = stack.pop(); int height = heights[tmp]; int width = stack.isEmpty() ? heights.length : heights.length - stack.peek() - 1; result = Math.max(result, height * width); } return result; } }
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步