首页 > itarticle > [leetcode] problem 11 – container with most water

[leetcode] problem 11 – container with most water

admin 11月 13, 2020 0

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.

Example

The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.

Input: [1,8,6,2,5,4,8,3,7]

Output: 49

Code

public int (int[] height) {
    int left = 0;
    int right = height.length - 1;
    int result = 0;

    while (left < right) {
        result = Math.max(result, Math.min(height[left], height[right]) * (right - left));

        if (height[left] < height[right])
            left++;
        else
            right--;
    }

    return result;
}