代码随想录day60

最新推荐文章于 2024-11-16 14:46:58 发布

yabayaoya

最新推荐文章于 2024-11-16 14:46:58 发布

阅读量224

点赞数

分类专栏： Leecode 文章标签： leetcode 算法动态规划

本文链接：https://blog.csdn.net/yabayaoya/article/details/129568101

版权

Leecode 专栏收录该内容

50 篇文章 0 订阅

订阅专栏

84. 柱状图中最大的矩形

https://leetcode.cn/problems/largest-rectangle-in-histogram/
理解题意：最大矩形，也就是相邻min的宽度乘以高度。
整体还是好难想到，看了讲解照着写了一下。

class Solution {
    public int largestRectangleArea(int[] heights) {
        Stack<Integer> st = new Stack<Integer>();
        int [] newHeights = new int[heights.length + 2];
        newHeights[0] = 0;
        newHeights[newHeights.length - 1] = 0;
        for (int index = 0; index < heights.length; index++){
            newHeights[index + 1] = heights[index];
        }
        heights = newHeights;
        st.push(0);
        int result = 0;
        for (int i = 1; i < heights.length; i++) {
            while (heights[i] < heights[st.peek()]) {
                    int mid = st.peek();
                    st.pop();
                    int left = st.peek();
                    int right = i;
                    int w = right - left - 1;
                    int h = heights[mid];
                    result = Math.max(result, w * h);
                }
                st.push(i);
        }
        return result;
    }
}