【LeetCode】 140 柱状图中最大的矩形

最新推荐文章于 2024-10-06 16:32:56 发布

JaneRoad

最新推荐文章于 2024-10-06 16:32:56 发布

阅读量85

点赞数

文章标签： leetcode 栈 stack dfs 动态规划

本文链接：https://blog.csdn.net/ChrisLu777/article/details/114283595

版权

题目：

解题思路：

https://leetcode-cn.com/problems/largest-rectangle-in-histogram/solution/bao-li-jie-fa-zhan-by-liweiwei1419/

代码：

import java.util.Arrays;
import java.util.Stack;

public class LC65 {
    public int largestRectangleArea(int[] heights) {
        int n = heights.length;
        int[] left = new int[n];
        int[] right = new int[n];
        Arrays.fill(right, n);

        Stack<Integer> mono_stack = new Stack<Integer>();
        for (int i = 0; i < n; ++i) {
            while (!mono_stack.isEmpty() && heights[mono_stack.peek()] >= heights[i]) {
                right[mono_stack.peek()] = i;
                mono_stack.pop();
            }
            left[i] = (mono_stack.isEmpty() ? -1 : mono_stack.peek());
            mono_stack.push(i);
        }

        int ans = 0;
        for (int i = 0; i < n; ++i) {
            ans = Math.max(ans, (right[i] - left[i] - 1) * heights[i]);
        }
        return ans;
    }


    public static void main(String[] args) {
        LC65 lc65 = new LC65();
        int[] heights = new int[]{2,1,5,6,2,3};
        System.out.println(lc65.largestRectangleArea(heights));
    }
}