【LeetCode】Container With Most Water
来源:互联网 发布:淘宝参数是什么意思 编辑:程序博客网 时间:2024/06/01 10:18
参考链接
http://blog.csdn.net/doc_sgl/article/details/12188919
http://blog.csdn.net/a83610312/article/details/8548519
http://www.cnblogs.com/codingmylife/archive/2012/09/05/2671548.html题目描述
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.
题目分析
题目意思就不翻译了,大概是要找到条纵线然后这两条线以及X轴构成的容器能容纳最多的水。
下面以例子: [4,6,2,6,7,11,2] 来讲解。
1.首先假设我们找到能取最大容积的纵线为 i , j (假定i<j),那么得到的最大容积 C = min( ai , aj ) * ( j- i) ;
2.下面我们看这么一条性质:
①: 在 j 的右端没有一条线会比它高! 假设存在 k |( j<k && ak > aj) ,那么 由 ak> aj,所以 min( ai,aj, ak) =min(ai,aj) ,所以由i, k构成的容器的容积C' = min(ai,aj ) * ( k-i) > C,与C是最值矛盾,所以得证j的后边不会有比它还高的线;
②:同理,在i的左边也不会有比它高的线;
这说明什么呢?如果我们目前得到的候选: 设为 x, y两条线(x< y),那么能够得到比它更大容积的新的两条边必然在 [x,y]区间内并且 ax' > =ax , ay'>= ay;
3.所以我们从两头向中间靠拢,同时更新候选值;在收缩区间的时候优先从 x, y中较小的边开始收缩;
直观的解释是:容积即面积,它受长和高的影响,当长度减小时候,高必须增长才有可能提升面积,所以我们从长度最长时开始递减,然后寻找更高的线来更新候补;
代码示例
class Solution {public: int maxArea(vector<int> &height) { // Start typing your C/C++ solution below // DO NOT write int main() function int size = height.size(); int left = 0, right = size-1;int max = 0;while(left < right){int minheight = min(height[left],height[right]);int tmp = minheight*(right-left);max = max > tmp ? max : tmp;if(height[left]<height[right])left++;else right--;}return max; }};
推荐学习C++的资料
- LeetCode: Container With Most Water
- [LeetCode]Container With Most Water
- LeetCode Container With Most Water
- LeetCode: Container With Most Water
- [Leetcode] Container With Most Water
- Leetcode: Container With Most Water
- [LeetCode] Container With Most Water
- LeetCode Container With Most Water
- [Leetcode] Container With Most Water
- [LeetCode]Container With Most Water
- LeetCode-Container With Most Water
- Container With Most Water leetcode
- LeetCode - Container With Most Water
- LeetCode: Container With Most Water
- Leetcode: Container With Most Water
- 【LeetCode】Container With Most Water
- Leetcode: Container With Most Water
- LeetCode:Container With Most Water
- delphi多线程编程
- javascrip引用类型object
- python画图
- linux系统中./configure --prefix 命令是什么意思?
- iOS越狱机子 进程间通讯
- 【LeetCode】Container With Most Water
- 交互设计学习day1 之三 工作流程说明
- Linux操作系统实验教程 费翔林主编 第二章 实验3 答案
- 过TesSafe反WinDbg双机调试
- SEO高级优化【PHP】-1
- 数据库 的版本为 661,无法打开。此服务器支持 655 版及更低版本。不支持降级路径
- QTP和翻译软件的故事(转自席飞剑) 另加个人测试结果
- jax-ws handler 例子
- 第六周作业——利用哈夫曼编码英文字母表