LeetCode力扣之Largest Rectangle in Histogram

最新推荐文章于 2022-03-06 11:55:32 发布

Lee_Wei4939

最新推荐文章于 2022-03-06 11:55:32 发布

阅读量151

点赞数

分类专栏：算法面试

本文链接：https://blog.csdn.net/liwei1205/article/details/79527581

版权

算法面试专栏收录该内容

89 篇文章 0 订阅

订阅专栏

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.

package leetCode;

import java.util.Stack;

/**
 * Created by lxw, liwei4939@126.com on 2018/3/12.
 */
public class L084_Largest_Rectangle_Histogram {

    public int largestRectangleArea(int[] height){

        if (height == null || height.length == 0){
            return 0;
        }

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

        while (!stack.empty()){
            int j = stack.pop();
            int k = stack.isEmpty() ? -1 : stack.peek();
            int curArea = (height.length - k -1)*height[j];
            maxArea = Math.max(curArea, maxArea);
        }

        return maxArea;
    }
}