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.
June 8, 2015
My favorite websites about this problem:
我喜欢这个题解, 从最笨的方法到最优的方法, 都解答一遍. 我用C#也来做一遍.
Here is my practice:
https://github.com/jianminchen/largestRectangleInHistogram/blob/master/Program.csJune 30, 2015
Totally forget the problem, and then, need second round study.
Read the blog:
http://segmentfault.com/a/1190000002673098
No comments:
Post a Comment