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.

• Time: O(n)
• Space: O(1)

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