[leetcode] Largest Rectangle in Histogram

最新推荐文章于 2025-09-11 18:44:42 发布

转载最新推荐文章于 2025-09-11 18:44:42 发布 · 61 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/fengmangZoo/p/4196976.html

文章标签：

#数据结构与算法

本文介绍了如何使用栈数据结构解决直方图中最大矩形面积的问题，详细解释了算法思路和实现步骤。

题目：（Stack）

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 height = [2,1,5,6,2,3],
return 10.

题解：

参考http://www.cnblogs.com/lichen782/p/leetcode_Largest_Rectangle_in_Histogram.html

难题，思路比较难想。多看看。

public class Solution {
    public int largestRectangleArea(int[] height) {
        Stack<Integer> stack = new Stack<Integer>();
        int [] h = new int[height.length+1];
        int i=0;
        int result=0;
        h = Arrays.copyOf(height, height.length+1);
        while(i<h.length)
        {
            if(stack.isEmpty()||h[i]>h[stack.peek()])
               stack.push(i++);
            else
            {
                int t = stack.pop();
                result = Math.max(result, h[t]*(stack.isEmpty()? i : i-stack.peek()-1));
            }
        }
        return result;
    }
}