11. Container With Most Water
来源:互联网 发布:淘宝客服人工服务时间 编辑:程序博客网 时间:2024/06/06 12:48
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.
class Solution {
public:int maxArea(vector<int>& height) {
int i=0;int j=height.size()-1;int maxa=0;
while (i<j)
{
int temp=(height[i]>height[j]?height[j]:height[i])*(j-i);
maxa=(maxa>temp?maxa:temp);
if (height [j]<=height[i]) j--;
temp=(height[i]>height[j]?height[j]:height[i])*(j-i);
maxa=(maxa>temp?maxa:temp);
if (height [i]<=height[j]) i++;
}
return maxa;
}
};
阅读全文
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
- HDU 5458 Stability
- Android开发小技巧系列(六)
- Cassandra cqlsh命令大全
- Time类
- WOJ1075-Ball
- 11. Container With Most Water
- Shell中函数的定义和使用
- cliptopadding和fitsSystemWindows
- poj1151 Atlantis(线段树+扫描线)
- 2017.9.2总结2-监听还原
- 【jzoj5341】【NOIP2017模拟9.2A组】【密州盛宴】
- 【风宇冲】Unity3D教程宝典之 C#代码注释规范及文档生成
- dubbo负载均衡源码解析balance
- Hello, World!