11. Container With Most Water
来源:互联网 发布:马天宇女装知乎 编辑:程序博客网 时间:2024/06/07 14:20
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.
class Solution {public: int maxArea(vector<int>& height) { int water = 0, n = height.size(); for(int i = 0, j = n-1; i < j; ){ int h = min(height[i], height[j]); water = max(water, (j-i) * h); while(height[i] <= h && i < j) i++; //在i增大和j减小的时候什么时候可能water更大? 只有height[i]/height[j]比h更大的时候 while(height[j] <= h && i < j) j--; } return water; }};
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
- 重载运算符+
- 几种快速将数组转换为List的方法,使用Arrays,Collections这两个工具类。
- bug宝典Linux篇 kill 命令
- RHCE认证过程
- Manacher算法
- 11. Container With Most Water
- 关于Https安全性问题、双向验证防止中间人攻击问题
- 多态小案例
- ubuntu git安装及使用
- Parallel Reduction --- (4) Free Loops
- MethodSwizzling
- string拼接字符串stringbuider和stringbuffer的区别
- Masonry多个控件的等间隔排序显示
- 梁启超家书致思成书-安之若命