Largest Rectangle in Histogram

最新推荐文章于 2024-11-16 19:28:39 发布

Clam30

最新推荐文章于 2024-11-16 19:28:39 发布

阅读量307

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/sinat_28088761/article/details/68490794

本文介绍了一种求解最大直方图面积的高效算法，采用栈数据结构实现O(n)时间复杂度的解决方案。通过实例说明了算法原理及其应用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

84. Largest Rectangle in Histogram

Description Submissions Solutions

Total Accepted: 84767
Total Submissions: 325790
Difficulty: Hard
Contributor: LeetCode

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.

Java代码：

O(n) stack based JAVA solution

wz366

Reputation: 365

For explanation, please see http://www.geeksforgeeks.org/largest-rectangle-under-histogram/

public class Solution {
    public int largestRectangleArea(int[] height) {
        int len = height.length;
        Stack<Integer> s = new Stack<Integer>();
        int maxArea = 0;
        for(int i = 0; i <= len; i++){
            int h = (i == len ? 0 : height[i]);
            if(s.isEmpty() || h >= height[s.peek()]){
                s.push(i);
            }else{
                int tp = s.pop();
                maxArea = Math.max(maxArea, height[tp] * (s.isEmpty() ? i : i - 1 - s.peek()));
                i--;
            }
        }
        return maxArea;
    }
}