Container With Most Water
来源:互联网 发布:vb代码编程实例 编辑:程序博客网 时间:2024/06/07 09:15
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.
Note: You may not slant the container and n is at least 2.
求容器的最大面积,通过遍历,将每个的(right-left)*height与最大面积比较。
0 0
- Container With Most Water
- Container with most water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- 22. Generate Parentheses
- centos6.X系统非root用户启动的程序无法创建超过1024个进程的问题
- CSS3笔记之第三天
- JavaScript笔记之第四天
- 迷失在追逐中
- Container With Most Water
- JPush极光推送Java服务器端实例
- c# Winform DataGridView 当前单元格失去焦点的有关问题
- linux无名管道
- Java泛型方法重写问题
- MySQL数据库备份
- SpringData 学习(4)—— 使用 @Query 注解实现查询
- 一台机器上安装zookeeper+kafka集群
- 广度优先搜索框架