原题地址 有两种方法，左右扫描或辅助栈。 方法I： 左右扫描法考虑到最大面积的矩形高度一定跟某个条一样高，所以挨个枚举每个条，看其向左 向右最多能延伸到多远。在计算左右边界时，可以借助之前计算过的结果迭代 类似动归的感觉 优化以减少时间复杂度，这应该算是唯一的难点了。总的来说，向左一遍，向右一遍，整体求面积再一遍，一共需要 次遍历，时间复杂度是O n 。 左右扫描法非常直观。 代码： 方法II： ...
2015-01-18 16:34 1 4082 推荐指数：
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 ...
原题地址：https://oj.leetcode.com/problems/largest-rectangle-in-histogram/ 题意： Given n non-negative integers representing ...
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 ...
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 ...
题目： Largest Rectangle in Histogram Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find ...
http://blog.csdn.net/abcbc/article/details/8943485 具体的题目描述为： Given n non-negative integers representing the histogram's bar height where ...
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 ...
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 ...
