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.

Notice

You may not slant the container.

Example Given [1,3,2], the max area of the container is 2.

Solution: From two sides to the middle and keep a max record result.

public int maxArea(int[] heights) {
    if(heights == null || heights.length == 0) {
        return 0;
    }
    int left = 0, right = heights.length - 1;
    int res = 0;
    while(left < right) {
        int rec = Math.min(heights[left], heights[right]) * (right - left);
        res = Math.max(rec, res);
        if(heights[left] < heights[right]) {
            left++;
        }
        else {
            right--;
        }
    }
    return res;
}