LeetCode-11.Container With Most Water
来源:互联网 发布:中国云计算方案大会 编辑:程序博客网 时间:2024/05/29 16:41
https://leetcode.com/problems/container-with-most-water/
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.
双指针
分别从两端开始移动,计算最大值。然后根据瓶颈是左端或者右端移动相应指针。
int maxArea(vector<int>& height) { int l=0,r=height.size()-1,res = 0; while (l<r) { res = max(res, min(height[l], height[r])*(r - l)); if (height[l]>height[r]) r--; else l++; } return res; }
参考 http://blog.csdn.net/linhuanmars/article/details/21145429
0 0
- LeetCode 11. Container With Most Water
- [LeetCode]11.Container With Most Water
- LeetCode --- 11. Container With Most Water
- LeetCode 11.Container With Most Water
- [Leetcode] 11. Container With Most Water
- [leetcode] 11.Container With Most Water
- 【leetcode】11. Container With Most Water
- [LeetCode]11. Container With Most Water
- 11. Container With Most Water LeetCode
- leetcode 11. Container With Most Water
- leetcode 11.Container With Most Water
- [LeetCode OJ]11. Container With Most Water
- [leetcode] 11. Container With Most Water
- Leetcode 11. Container With Most Water
- leetcode 11.Container With Most Water
- leetcode 11. Container With Most Water
- LeetCode 11. Container With Most Water
- LeetCode *** 11. Container With Most Water
- java GUI
- Django安装
- pixhawk添加一个新的MAVLink 消息
- 备份压缩命令 - tar
- Linux下递归遍历指定目录下的文件内容并删除的函数实现
- LeetCode-11.Container With Most Water
- java环境变量设置
- 数学
- [androiod]_[Service基本使用]
- 琐事MARK
- 5种单例模式的介绍与比较
- Java注解(Annotation)介绍
- mysql5.5配置半同步复制
- Jquery弹出框效果 自己下载看看是否搭配风格