Leetcode - Container With Most Water

Problem,#

You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).

Find two lines that together with the x-axis form a container, such that the container contains the most water.

Return the maximum amount of water a container can store.

Notice that you may not slant the container.

Solution,#

Two Pointer 로 쉽게 풀 수 있다. 집합의 첫 번째 원소와 마지막 원소를 기준으로 잡고, 더 작은 쪽이 언제나 기준이 된다.

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

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

        return max;
    }
}