[Leetcode] Container With Most Water

思路来自转载：
http://www.cnblogs.com/remlostime/archive/2012/10/29/2745018.html

public static int maxArea(int[] height) {        int max_area = 0;        if (height == null || height.length <= 1) {            return 0;        }        int left = 0;        int right = height.length - 1;        while (left < right) {            int h = height[left] < height[right] ? height[left] : height[right];            int area = (right - left) * h;            max_area = area > max_area ? area : max_area;            if (height[left] > height[right]) {                right--;            }            else {                left++;            }        }        return max_area;    }