-
Notifications
You must be signed in to change notification settings - Fork 279
/
11 Container With Most Water.js
48 lines (41 loc) · 1.17 KB
/
11 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
46
47
48
// 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 and n is at least 2.
//
// 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:
//
// Input: [1,8,6,2,5,4,8,3,7]
// Output: 49
//
// Given fixed set of vertical bars
// Min case
//
// . .
// . . . .
// . . . . . .
// Max case
//
// . .
// . . . .
// . . . . . .
/**
* @param {number[]} height
* @return {number}
*/
var maxArea = function(height) {
var left = 0;
var right = height.length - 1;
var maxVal = 0;
while(left<right){
var contain = (right-left)*Math.min(height[left],height[right]);
maxVal = Math.max(contain, maxVal);
if(height[left] >= height[right]){
right--;
} else {
left++;
}
}
return maxVal;
};