LeetCode 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 ContainerWithMostWater {
    public static int maxArea(int[] height){
        int maxarea = 0;
        int area = 0;
        int l = 0;
        int r = height.length - 1;
        while( l < r){
            area = min(height[l] , height[r]) * ( r - l);
            if ( area > maxarea)
                maxarea = area;
            
            if( height[l] < height[r])
                l++;
            else
                r--;
        }
        return maxarea;
    }
    
    static int min( int a,int b){
        return a>b ? b : a;
    }
}