LeetCode345 Container With Most Water

题目：

       Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). nvertical 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 and n is at least 2.

       

       The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49. 

       Example:

              Input: [1,8,6,2,5,4,8,3,7]

       Output: 49

public class ContainerWithMostWater {
    public static int maxArea(int[] height) {
        if (height == null || height.length < 2)
            return 0;

        int area = 0;

        int l = 0;
        int r = height.length - 1;
        while(l < r){
            int tempArea = Math.min(height[l], height[r])*(r-l);
            if(height[r]>height[l]){
                l++;
            } else {
                r--;
            }
            area = area>tempArea?area:tempArea;
        }

        return area;
    }

    public static void main(String[] args) {
        int[] height = {1,8,6,2,5,4,8,3,7};
        System.out.println(maxArea(height));
    }
}