leetcode 84. Largest Rectangle in Histogram

最新推荐文章于 2024-01-26 10:15:16 发布

zhangwj0101

最新推荐文章于 2024-01-26 10:15:16 发布

阅读量312

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/zhangwj0101/article/details/51114872

版权

Leetcode 专栏收录该内容

51 篇文章 0 订阅

订阅专栏

Question

Given n non-negative integers representing the histogram’s bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.

Above is a histogram where width of each bar is 1, given height = [2,1,5,6,2,3].

The largest rectangle is shown in the shaded area, which has area = 10 unit.

For example,
Given heights = [2,1,5,6,2,3],
return 10.

Code

 public int largestRectangleArea(int[] height) {
        if (height == null || height.length == 0) {
            return 0;
        }

        Stack<Integer> stack = new Stack<Integer>();
        int max = 0;
        for (int i = 0; i <= height.length; i++) {
            int curt = (i == height.length) ? -1 : height[i];
            while (!stack.isEmpty() && curt <= height[stack.peek()]) {
                int h = height[stack.pop()];
                int w = stack.isEmpty() ? i : i - stack.peek() - 1;
                max = Math.max(max, h * w);
            }
            stack.push(i);
        }

        return max;

    }