代码随想录day60

最新推荐文章于 2025-08-21 20:43:22 发布

写bug小能手_

最新推荐文章于 2025-08-21 20:43:22 发布

阅读量376

点赞数

CC 4.0 BY-SA版权

分类专栏：算法打卡文章标签： leetcode 算法数据结构

本文链接：https://blog.csdn.net/weixin_43821876/article/details/128943237

算法打卡专栏收录该内容

54 篇文章

订阅专栏

84. 柱状图中最大的矩形

双指针,超时，离谱子

class Solution {
    public int largestRectangleArea(int[] heights) {
        // 双指针
        int res = 0;
        for(int i = 0;i < heights.length;i++){
            int cur = heights[i];
            int left = i;
            while(left > 0 && heights[left -1] >= cur){
                left --;
            }
            int right = i;
            while(right < heights.length - 1 && heights[right + 1] >= cur){
                right ++;
            }
            int h = heights[i];
            int w = right - left + 1;
            res = Math.max(res,h * w);
        }
        return res;

    }
}

class Solution {
    public int largestRectangleArea(int[] heights) {
        Deque<Integer> stack = new LinkedList<>();
        int [] newHeights = new int[heights.length + 2];
        newHeights[0] = 0;
        newHeights[newHeights.length - 1] = 0;
        for(int i = 0;i < heights.length;i++){
            newHeights[i+1] = heights[i];
        }
        heights = newHeights;
        stack.push(0);
        int res = 0;
        for(int i = 1;i < heights.length;i++){
            if(heights[stack.peek()] <= heights[i]){
                stack.push(i);         //获取的是从小到大的元素
            }else{
                while(!stack.isEmpty() && heights[stack.peek()] > heights[i] ){
                    int mid = stack.peek();  //这个就是两边比他小的   首先他是单调调增，再加上当前元素是比他小的
                    stack.pop();
                    int h = heights[mid]; 
                    int w = i - stack.peek() - 1;
                    res = Math.max(res,h*w);
                }
                stack.push(i);
            }
        }
        return res;

    }
}