Problem:

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.

Analysis:

This question was confusing, be sure to make sure what kind of container, I thought only neighbor lines can be part of the container so I ‘solved’ it with just one line.

It is easily to come up with a O(n^2) solution, however there are a lot of cases we counted twice.

```
public class Solution {
public int maxArea(int[] height) {
int left = 0;
int right = height.length-1;
int result = 0;
while (left < right) {
result = Math.max(((right-left)*Math.min(height[left], height[right])), result);
if (height[left] < height[right]) left++;
else right--;
}
return result;
}
}
```

Advertisements