leetcode 84 :Largest Rectangle in Histogram
2015-07-19 21:35
375 查看
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 =
The largest rectangle is shown in the shaded area, which has area =
For example,
Given height =
return
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 =
10unit.
For example,
Given height =
[2,1,5,6,2,3],
return
10.
相关文章推荐
- java 帮助文档API下载地址
- Unity3D与设计模式(一)先从OO和设计模式讲起
- CodeForces 474B E(Contest #1)
- 绑定变量赋值
- cocos2d-x 3.2 它 2048 —— 第三
- Android测试游戏帧数的方法
- Ueditor实现自定义conttoller请求或跨域请求
- Android NDK环境搭建(Android Studio)
- Java的Swing入门,继承JFrame报错问题
- 在Windows 2003中安装UDDI服务器及其使用
- dedecms body 输出自动替换结果。
- PHP中类的继承关系
- Kruskal算法的并查集实现
- linux命令4 find、三个时间属性、硬链接和软连接、用户名和密码文件、增加和删除用户组、usermod、su、sudo
- 2.1 linux文件系统相关函数
- iOS 即使通讯第三方SDK 资料
- 认识、安装和配置PHP
- windows下安装jmeter
- 双击事件处理
- HttpClient模拟浏览器登录后发起请求(携带Cookie发请求)以及网页显示的事件过程