-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathContainer_With_Most_Water.js
45 lines (35 loc) · 1.19 KB
/
Container_With_Most_Water.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
// 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.
// 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
// Constraints:
// n == height.length
// 2 <= n <= 105
// 0 <= height[i] <= 104
/**
* @param {number[]} height
* @return {number}
*/
var maxArea = function (height) {
const calcArea = (b, h) => {
return b * h;
};
let n = height.length,
area = 0;
let i = 0,
l = n - 1;
while (i < l) {
let tempArea = calcArea(l - i, Math.min(height[i], height[l]));
if (area < tempArea) area = tempArea;
if (height[i] <= height[l]) i++;
else if (height[i] > height[l]) l--;
}
return area;
};