11. 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.

public class Solution {
    public int maxArea(int[] height) {
        int i=0,j=height.length-1;
        int result=0,area=0;
        while(i<j)
        {
            area = Math.min(height[i],height[j])*(j-i);
            result = Math.max(result,area);
            if(height[i]<height[j])  //移动最短的线，才能找到比之前更大的面积；如果移动最长的线，寻找到的面积反而减小（宽减小）
               i++;
            else
               j--;
        }
        return result;
    }
}