-
Notifications
You must be signed in to change notification settings - Fork 5
/
Java1DArrayPart2.java
47 lines (40 loc) · 1.17 KB
/
Java1DArrayPart2.java
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
/**
* Mindula Dilthushan
* Hacker Rank - Java
* minduladilthushan1@gmail.com
*/
import java.util.*;
public class Java1DArrayPart2 {
public static boolean canWin(int leap, int[] game) {
// Return true if you can win the game; otherwise, return false.
return canWin(leap, game, 0);
}
public static boolean canWin(int leap, int[] g, int i) {
if (i < 0 || g[i] == 1) {
return false;
}
if (i + leap >= g.length || i == g.length - 1) {
return true;
}
g[i] = 1;
return (
canWin(leap, g, i + 1) ||
canWin(leap, g, i + leap) ||
canWin(leap, g, i - 1)
);
}
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int q = scan.nextInt();
while (q-- > 0) {
int n = scan.nextInt();
int leap = scan.nextInt();
int[] game = new int[n];
for (int i = 0; i < n; i++) {
game[i] = scan.nextInt();
}
System.out.println((canWin(leap, game)) ? "YES" : "NO");
}
scan.close();
}
}