11. Container With Most Water
来源:互联网 发布:淘宝千人千面原理 编辑:程序博客网 时间:2024/06/16 17:45
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.
时间复杂度O(n2)class Solution { public int maxArea(int[] height) { int l = 0; int area = 0; for (int i = 0; i < height.length - 1; i++) { for (int j = i; j < height.length; j++) { area = Math.max(area, Math.abs((j - i) * Math.min(height[j], height[i]))); } } return area; }}
阅读全文
0 0
- 11.Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11.Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 用python爬虫爬取去哪儿4500个热门景点,看看国庆不能去哪儿
- 前文提要
- linux下部署apache软件
- 修改Realm中授权方法查询登录人的权限
- 进程调度API之yield
- 11. Container With Most Water
- 10. find
- 3.7if
- 小Z的袜子 bzoj2038 莫队
- 外教活动总结
- 深入理解函数的调用--栈帧
- 揭秘深度学习成功的数学原因:从全局最优性到学习表征不变性
- 外围信息搜集
- 程序输入法汉子字库