[LeetCode][JavaScript]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.

https://leetcode.com/problems/container-with-most-water/

---

先看了Trapping Rain Water从Similar Problems里找到这道，迷糊了好久。

就是选2块隔板，隔板之间的不占容积。

双指针水题。

/**
 * @param {number[]} height
 * @return {number}
 */
var maxArea = function(height) {
    var i = 0, j = height.length - 1, max = 0, curr;
    while(i < j){
        curr = Math.min(height[i], height[j]) * (j - i);
        if(curr > max){
            max = curr;
        }
        height[i] < height[j] ? i++ : j--;
    }
    return max;
};