LeetCode - Container With Most Water

Question Definition

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 and n is at least 2.

Java Solution

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

Comments