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.
Solution:
1. public class Solution {
2. public int maxArea(int[] height) {
3. int n = height.length, max = 0;
4. 5. int i = 0, j = n - 1;
6. 7. while (i < j) {
8. int area = Math.min(height[i], height[j]) * (j - i);
9. max = Math.max(max, area);
10. 11. if (height[i] < height[j]) {
12. i++;
13. } else {
14. j--;
15. }
16. }
17. 18. return max;
19. }
20. }