【代码随想录 Day60 单调栈 part03】84.柱状图中最大的矩形

Day60

84.柱状图中最大的矩形

单调栈

class Solution {
   public int largestRectangleArea(int[] heights) {
        int n = heights.length;
        int newHeights[] = new int[n + 2];
        newHeights[0] = 0;
        newHeights[n + 1] = 0;
        for (int i = 1; i < n + 1; i++) {
            newHeights[i] = heights[i - 1];
        }
        Stack<Integer> stack = new Stack<>();
        stack.push(0);
        int res = 0;
        for (int i = 1; i < n + 2; i++) {
            if (newHeights[i] > newHeights[stack.peek()]) {
                stack.push(i);
            } else if (newHeights[i] == newHeights[stack.peek()]) {
                stack.pop();
                stack.push(i);
            } else {
                while (!stack.isEmpty() && newHeights[i] < newHeights[stack.peek()]) {
                    int height = newHeights[stack.pop()];
                    int width = i - stack.peek() - 1;
                    res = Math.max(res, height * width);
                }
                stack.push(i);
            }
        }
        return res;
    }
}

双指针

class Solution {
   public int largestRectangleArea(int[] heights) {
        int n = heights.length;
        int minLeftIndex[] = new int[n];
        minLeftIndex[0] = -1;
        int minRightIndex[] = new int[n];
        minRightIndex[n - 1] = n;
        for (int i = 1; i < n; i++) {
            int t = i - 1;
            while (t >= 0 && heights[t] >=heights[i]) t = minLeftIndex[t];
            minLeftIndex[i] = t;
        }
        for (int i = n - 2; i >= 0; i--) {
            int t = i + 1;
            while (t < n && heights[t] >=heights[i]) t = minRightIndex[t];
            minRightIndex[i] = t;
        }
        int res = 0;
        for (int i = 0; i < n; i++) {
            res = Math.max(res, (minRightIndex[i] - minLeftIndex[i] - 1) * heights[i]);
        }
        return res;
    }
}