[LeetCode]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.

Note: You may not slant the container.

题解：从网上看到的，只知道left++，right--,表示不是很懂，没有证明。

public class Solution {    public int maxArea(int[] height) {                if(height == null || height.length ==1)             return 0;       int area =0,max = 0;       int left = 0,right =height.length-1;       while(left<right){                      max = Math.max(max,(right-left)*Math.min(height[left],height[right]));           if(height[left]>height[right])                    right--;           else                    left++;       }       return max;    }}