11. Container With Most Water
Tags
- Array
- Two Pointers
- Greedy
Link
Question
You are given an integer array
heightof lengthn. There arenvertical 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.
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: 1Constraints:
n == height.length2 <= n <= 1050 <= height[i] <= 104
Answer
JavaScript
/**
* @param {number[]} height
* @return {number}
*/
var maxArea = function (height) {
let x = height.length;
let l = 0,
r = x - 1;
let max_area = 0;
while (l < r) {
let area = Math.min(height[l], height[r]) * (r - l);
max_area = Math.max(max_area, area);
if (height[l] < height[r]) l++;
else r--;
}
return max_area;
};