-
Notifications
You must be signed in to change notification settings - Fork 0
/
003.jumping,clouds.js
40 lines (37 loc) · 1.43 KB
/
003.jumping,clouds.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
/*
Emma is playing a new mobile game that starts with consecutively numbered clouds.
Some of the clouds are thunderheads and others are cumulus. She can jump on any cumulus
cloud having a number that is equal to the number of the current cloud plus `1` or `2`.
She must avoid the thunderheads. Determine the minimum number of jumps it will take Emma
to jump from her starting postion to the last cloud. It is always possible to win the game.
For each game, Emma will get an array of clouds numbered `0` if they are safe or `1` if they
must be avoided. For example `c = [0, 1, 0, 0, 0, 1, 0], indexed from `0..6`. The number on
each cloud is its index in the list so she must avoid the clouds at indexes `1` and `5`.
She could follow the following two paths: 0 -> 2 -> 4 -> 6 or 0 -> 2 -> 3 -> 4 -> 6.
The first path takes `3` jumps while the second takes `4`.
*/
function jumpingOnClouds(c) {
var i = 0;
var l = c.length;
var noj = 0;
while(i < l) {
if(i == l - 1) break;
if(c[i] === 0
&& i + 2 < l
&& c[i + 2] === 0) {
noj++;
i = i + 2;
}
else{
if(c[i] === 0
&& i + 1 < l
&& c[i + 1] === 0) {
noj++;
i = i + 1;
}
}
}
return noj;
}
// Should print `4`
console.log(jumpingOnClouds([0, 0, 1, 0, 0, 1, 0]));