-
Notifications
You must be signed in to change notification settings - Fork 156
/
Copy pathpour_water.js
109 lines (95 loc) · 2.26 KB
/
pour_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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
/**
* Pour Water
*
* For example:
*
* heights = [5, 4, 2, 1, 2, 3, 2, 1, 0, 1, 2, 4]
* location = 5
* water = 13
*
* Your output should be: [ 0, 0, 1, 2, 1, 0, 1, 2, 3, 2, 1, 0 ]
*
* This is how the container looks like
*
* | water
* |
* v
* +
* ++ +
* ++WWW+WWWWW+
* +++W+++WWW++
* ++++++++W+++
* ++++++++++++
*/
/**
* @param {number[]} heights
* @param {number} location
* @param {number} water
*/
const pourWater = (heights, location, water) => {
const waters = Array(heights.length).fill(0);
let pourLocation;
while (water > 0) {
// Handle left-hand side
// Search for the lowest valley on the left
let left = location - 1;
while (left >= 0) {
if (heights[left] + waters[left] > heights[left + 1] + waters[left + 1]) {
break;
}
left--;
}
if (heights[left + 1] + waters[left + 1] < heights[location] + waters[location]) {
pourLocation = left + 1;
waters[pourLocation]++;
water--;
continue;
}
// Handle right-hand side
// Search for the lowest valley on the right
let right = location + 1;
while (right < heights.length) {
if (heights[right] + waters[right] > heights[right - 1] + waters[right - 1]) {
break;
}
right++;
}
if (heights[right - 1] + waters[right - 1] < heights[location] + waters[location]) {
pourLocation = right - 1;
waters[pourLocation]++;
water--;
continue;
}
// Handle the original pour location
pourLocation = location;
waters[pourLocation]++;
water--;
}
return waters;
};
/**
* @param {number[]} heights
* @param {number[]} waters
*/
const print = (heights, waters) => {
const n = heights.length;
let maxHeight = 0;
for (let i = 0; i < n; i++) {
maxHeight = Math.max(maxHeight, heights[i] + waters[i]);
}
let row = '';
for (let height = maxHeight; height >= 0; height--) {
for (let i = 0; i < n; i++) {
if (height <= heights[i]) {
row += '+';
} else if (height > heights[i] && height <= heights[i] + waters[i]) {
row += 'W';
} else {
row += ' ';
}
}
if (height > 0) row += '\n';
}
return row;
};
export { pourWater, print };