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.
合理性解释：当左端线段L小于右端线段R时，我们把L右移，这时舍弃的是L与右端其他线段（R-1, R-2, ...）组成的木桶，这些木桶是没必要判断的，因为这些木桶的容积肯定都没有L和R组成的木桶容积大。
public class Solution {
public int maxArea(int[] height) {
int len=height.length;
if(len<2){
return 0;
}
int area=0;
int l=0;
int r=len-1;
while(l<r){
if(height[l]<height[r]){
int v=(r-l)*height[l];
if(v>area){
area=v;
}
l++;
}
else{
int v=(r-l)*height[r];
if(v>area){
area=v;
}
r--;
}
}
return area;
}
}
LeetCode-Container With Most Water
原文：http://www.cnblogs.com/incrediblechangshuo/p/5309408.html