leetcode84

最新推荐文章于 2020-12-26 11:07:43 发布

ysxforever

最新推荐文章于 2020-12-26 11:07:43 发布

阅读量131

点赞数

分类专栏： leetcode刷题

本文链接：https://blog.csdn.net/weixin_37924741/article/details/105405587

版权

leetcode刷题专栏收录该内容

17 篇文章 0 订阅

订阅专栏

单调栈的妙用

//普通解法
class Solution {
    public int largestRectangleArea(int[] heights) {
        if(heights==null||heights.length == 0) return 0;
       //双指针法
       int left = 0;
       int right = heights.length - 1;
       int maxRet = 0;
       int step = 0;//0 左指针右移  1 右指针左移
       while(left<heights.length){
           int minHeight = Integer.MAX_VALUE;
           for(int i=left;i<=right;i++){
               minHeight = Math.min(minHeight,heights[i]);//这里不能使用循环,要记录之前的状态进行优化即可
               int tmp = (i - left + 1) * minHeight;
               if(tmp > maxRet) maxRet = tmp;
           }
            left++;
       } 
       return maxRet;
    }
}

//单调栈解法
public class Solution {
    public  int largestRectangleArea(int[] heights) {
        if(heights==null||heights.length == 0) return 0;
        Stack<Integer> stack = new Stack<>();
        stack.push(-1);
        int maxRet = 0;
        for(int i=0;i<heights.length;i++){
            while(stack.peek()!=-1 && heights[stack.peek()]>=heights[i]){
                int p = stack.pop();
                int square = (i - stack.peek() - 1) * heights[p];//这里一定是stack.peek()-1而不是直接是p
                //因为堆栈里前一个索引跟这个弹出的索引不一定是相邻的,不一定固定差1!!!
                if(square > maxRet) maxRet = square;
            }
            stack.push(i);
        }
        while(stack.peek()!=-1){
            int p = stack.pop();
            int square = (heights.length - stack.peek() - 1) * heights[p];//这里一定是stack.peek()-1而不是直接是p
            if(square > maxRet) maxRet = square;
        }

        return maxRet;
    }
}