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

.

Analysis:

Begin with the first point and last point, calculate the container area. Move the first point forward or last point backward if it is smaller.

public class Solution {
/**
* @param heights: an array of integers
* @return: an integer
*/
public int maxArea(int[] height) {
if (height == null || height.length <= 1) return 0;

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