container-with-most-water
来源:互联网 发布:中国木制品数据 编辑:程序博客网 时间:2024/06/05 07:59
给定 n 个非负整数 a1, a2, ..., an, 每个数代表了坐标中的一个点(i, ai)
。画 n 条垂直线,使得 i 垂直线的两个端点分别为(i, ai)
和(i, 0)
。找到两条线,使得其与 x 轴共同构成一个容器,以容纳最多水。
Yes
样例
给出[1,3,2]
, 最大的储水面积是2
.
class Solution {public: int maxArea(vector<int> &h) { int n=h.size(); if(n<=1) return 0; int left=0,right=n-1; int res=0; while(left<right){ res=max(res,(right-left)*min(h[left],h[right])); if(h[left]<h[right]) left++; else if(h[left]>h[right]) right--; else{ left++; right--; } } return res; }};
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
- 重新学习COCOs2D-X版本2.2.3开始---第一篇引擎的游戏入口
- POJ 1089 解题报告
- printf( )的格式字符
- NSDate NSString NSArray NSDictionary 数据类型相互转换
- fs4412开发板学习笔记(九)
- container-with-most-water
- 一些实用PHP代码片段
- Two Sum
- ZigZag Conversion
- 整数的拆分
- springMVC配置一个通配的url请求,替代@RequestMapping中指定的方式
- fs4412开发板学习笔记(十)
- Java异常捕获之try...catch...finally语句
- Android(5)多选按钮CheckBox、OnClickListener、OnCheckedChangeListener