[LeetCode] Container With Most Water

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: Two pointers. See the discussions. 

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

public class Solution { public int maxArea(int[] height) { int i = 0; int j = height.length - 1; int maxArea = 0; while (i < j) { int w = j - i; int h = Math.min(height[i], height[j]); int area = w * h; if (maxArea < area) { maxArea = area; } if (height[i] < height[j]) { i++; } else { j--; } } return maxArea; } }