本文详细解析LeetCode第84题《Largest Rectangle in Histogram》的算法思路，包括如何找到最大矩形面积。讨论了两种解法：利用栈的实现和分治算法，提供完整代码，并给出输出结果。
LeetCode刷题：84. Largest Rectangle in Histogram
原题链接：https://leetcode.com/problems/largest-rectangle-in-histogram/
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.
Example:
Input: [2,1,5,6,2,3]
Output: 10
算法分
最低0.47元/天 解锁文章
495
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
