[JS] Container With Most Water

🔒 문제 (LeetCode 11)

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.

Constraints:

• n == height.length
• 2 <= n <= 105
• 0 <= height[i] <= 104

 

🌊 입출력

Example 1:

Input: height = [1,8,6,2,5,4,8,3,7]
Output: 49
Explanation: 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.

Example 2:

Input: height = [1,1]
Output: 1

 

---

 

🔑 해결

🌌 알고리즘 - 투포인터

/**
 * @param {number[]} height
 * @return {number}
 */
var maxArea = function(height) {
    let result = 0;
    let l = 0;
    let r = height.length - 1;
    
    while(l < r) {
        const area = Math.min(height[l], height[r]) * (r - l);
        result = Math.max(result, area);
        height[l] < height[r] ? l++ : r--;
    }
    
    return result;
};