本文探讨了如何解决给定非负整数数组代表直方图高度的情况下，找到直方图中最大矩形面积的问题。从暴力法出发，通过深入分析文章提供的解法二，实现了更高效的算法实现。实例演示了将数组 [2,1,5,6,2,3] 转换为最大面积 10 的矩形过程。
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://blog.youkuaiyun.com/doc_sgl/article/details/11805519
扫一扫
180
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
