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

Java: 

1. 征服代码：http://blog.csdn.net/linhuanmars/article/details/21145429

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

2.http://www.cnblogs.com/lichen782/p/leetcode_Container_With_Most_Water.html

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

}