hackerrank-java/src/DataStructure/Java1DArrayPart2.java at master · sonmez-hakan/hackerrank-java · GitHub

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
packageDataStructure;

importjava.util.*;

publicclassJava1DArrayPart2 {

privatestaticintleap = 0;

privatestaticint[] game;

privatestaticint[] went;

privatestaticintlength;

publicstaticbooleanplay(intindex)
 {
went[index] = 1;
if (index + 1 == length && game[length] == 0) {
returntrue;
 }

if (leap > 1) {
if (index + leap > length) {
returntrue;
 }

if (game[index + leap] == 0 && went[index + leap] == 0 && play(index + leap)) {
returntrue;
 }
 }

if (game[index + 1] == 0 && went[index + 1] == 0 && play(index + 1)) {
returntrue;
 }

if (index - 1 >= 0 && game[index - 1] == 0 && went[index - 1] == 0 && play(index - 1)) {
returntrue;
 }

returnfalse;
 }

publicstaticbooleancanWin(intleap, int[] game) {
Java1DArrayPart2.went = newint[game.length];
Java1DArrayPart2.game = game;
Java1DArrayPart2.leap = leap;
Java1DArrayPart2.length = game.length - 1;

returnplay(0);
 }

publicstaticvoidmain(String[] args) {
Scannerscan = newScanner(System.in);
intq = scan.nextInt();
while (q-- > 0) {
intn = scan.nextInt();
intleap = scan.nextInt();

int[] game = newint[n];
for (inti = 0; i < n; i++) {
game[i] = scan.nextInt();
 }

System.out.println( (canWin(leap, game)) ? "YES" : "NO" );
 }
scan.close();
 }
}
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
packageDataStructure;

importjava.util.*;

publicclassJava1DArrayPart2 {

privatestaticintleap = 0;

privatestaticint[] game;

privatestaticint[] went;

privatestaticintlength;

publicstaticbooleanplay(intindex)
 {
went[index] = 1;
if (index + 1 == length && game[length] == 0) {
returntrue;
 }

if (leap > 1) {
if (index + leap > length) {
returntrue;
 }

if (game[index + leap] == 0 && went[index + leap] == 0 && play(index + leap)) {
returntrue;
 }
 }

if (game[index + 1] == 0 && went[index + 1] == 0 && play(index + 1)) {
returntrue;
 }

if (index - 1 >= 0 && game[index - 1] == 0 && went[index - 1] == 0 && play(index - 1)) {
returntrue;
 }

returnfalse;
 }

publicstaticbooleancanWin(intleap, int[] game) {
Java1DArrayPart2.went = newint[game.length];
Java1DArrayPart2.game = game;
Java1DArrayPart2.leap = leap;
Java1DArrayPart2.length = game.length - 1;

returnplay(0);
 }

publicstaticvoidmain(String[] args) {
Scannerscan = newScanner(System.in);
intq = scan.nextInt();
while (q-- > 0) {
intn = scan.nextInt();
intleap = scan.nextInt();

int[] game = newint[n];
for (inti = 0; i < n; i++) {
game[i] = scan.nextInt();
 }

System.out.println( (canWin(leap, game)) ? "YES" : "NO" );
 }
scan.close();
 }
}
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
packageDataStructure;

importjava.util.*;

publicclassJava1DArrayPart2 {

privatestaticintleap = 0;

privatestaticint[] game;

privatestaticint[] went;

privatestaticintlength;

publicstaticbooleanplay(intindex)
 {
went[index] = 1;
if (index + 1 == length && game[length] == 0) {
returntrue;
 }

if (leap > 1) {
if (index + leap > length) {
returntrue;
 }

if (game[index + leap] == 0 && went[index + leap] == 0 && play(index + leap)) {
returntrue;
 }
 }

if (game[index + 1] == 0 && went[index + 1] == 0 && play(index + 1)) {
returntrue;
 }

if (index - 1 >= 0 && game[index - 1] == 0 && went[index - 1] == 0 && play(index - 1)) {
returntrue;
 }

returnfalse;
 }

publicstaticbooleancanWin(intleap, int[] game) {
Java1DArrayPart2.went = newint[game.length];
Java1DArrayPart2.game = game;
Java1DArrayPart2.leap = leap;
Java1DArrayPart2.length = game.length - 1;

returnplay(0);
 }

publicstaticvoidmain(String[] args) {
Scannerscan = newScanner(System.in);
intq = scan.nextInt();
while (q-- > 0) {
intn = scan.nextInt();
intleap = scan.nextInt();

int[] game = newint[n];
for (inti = 0; i < n; i++) {
game[i] = scan.nextInt();
 }

System.out.println( (canWin(leap, game)) ? "YES" : "NO" );
 }
scan.close();
 }
}
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
packageDataStructure;

importjava.util.*;

publicclassJava1DArrayPart2 {

privatestaticintleap = 0;

privatestaticint[] game;

privatestaticint[] went;

privatestaticintlength;

publicstaticbooleanplay(intindex)
 {
went[index] = 1;
if (index + 1 == length && game[length] == 0) {
returntrue;
 }

if (leap > 1) {
if (index + leap > length) {
returntrue;
 }

if (game[index + leap] == 0 && went[index + leap] == 0 && play(index + leap)) {
returntrue;
 }
 }

if (game[index + 1] == 0 && went[index + 1] == 0 && play(index + 1)) {
returntrue;
 }

if (index - 1 >= 0 && game[index - 1] == 0 && went[index - 1] == 0 && play(index - 1)) {
returntrue;
 }

returnfalse;
 }

publicstaticbooleancanWin(intleap, int[] game) {
Java1DArrayPart2.went = newint[game.length];
Java1DArrayPart2.game = game;
Java1DArrayPart2.leap = leap;
Java1DArrayPart2.length = game.length - 1;

returnplay(0);
 }

publicstaticvoidmain(String[] args) {
Scannerscan = newScanner(System.in);
intq = scan.nextInt();
while (q-- > 0) {
intn = scan.nextInt();
intleap = scan.nextInt();

int[] game = newint[n];
for (inti = 0; i < n; i++) {
game[i] = scan.nextInt();
 }

System.out.println( (canWin(leap, game)) ? "YES" : "NO" );
 }
scan.close();
 }
}
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
packageDataStructure;

importjava.util.*;

publicclassJava1DArrayPart2 {

privatestaticintleap = 0;

privatestaticint[] game;

privatestaticint[] went;

privatestaticintlength;

publicstaticbooleanplay(intindex)
 {
went[index] = 1;
if (index + 1 == length && game[length] == 0) {
returntrue;
 }

if (leap > 1) {
if (index + leap > length) {
returntrue;
 }

if (game[index + leap] == 0 && went[index + leap] == 0 && play(index + leap)) {
returntrue;
 }
 }

if (game[index + 1] == 0 && went[index + 1] == 0 && play(index + 1)) {
returntrue;
 }

if (index - 1 >= 0 && game[index - 1] == 0 && went[index - 1] == 0 && play(index - 1)) {
returntrue;
 }

returnfalse;
 }

publicstaticbooleancanWin(intleap, int[] game) {
Java1DArrayPart2.went = newint[game.length];
Java1DArrayPart2.game = game;
Java1DArrayPart2.leap = leap;
Java1DArrayPart2.length = game.length - 1;

returnplay(0);
 }

publicstaticvoidmain(String[] args) {
Scannerscan = newScanner(System.in);
intq = scan.nextInt();
while (q-- > 0) {
intn = scan.nextInt();
intleap = scan.nextInt();

int[] game = newint[n];
for (inti = 0; i < n; i++) {
game[i] = scan.nextInt();
 }

System.out.println( (canWin(leap, game)) ? "YES" : "NO" );
 }
scan.close();
 }
}
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
packageDataStructure;

importjava.util.*;

publicclassJava1DArrayPart2 {

privatestaticintleap = 0;

privatestaticint[] game;

privatestaticint[] went;

privatestaticintlength;

publicstaticbooleanplay(intindex)
 {
went[index] = 1;
if (index + 1 == length && game[length] == 0) {
returntrue;
 }

if (leap > 1) {
if (index + leap > length) {
returntrue;
 }

if (game[index + leap] == 0 && went[index + leap] == 0 && play(index + leap)) {
returntrue;
 }
 }

if (game[index + 1] == 0 && went[index + 1] == 0 && play(index + 1)) {
returntrue;
 }

if (index - 1 >= 0 && game[index - 1] == 0 && went[index - 1] == 0 && play(index - 1)) {
returntrue;
 }

returnfalse;
 }

publicstaticbooleancanWin(intleap, int[] game) {
Java1DArrayPart2.went = newint[game.length];
Java1DArrayPart2.game = game;
Java1DArrayPart2.leap = leap;
Java1DArrayPart2.length = game.length - 1;

returnplay(0);
 }

publicstaticvoidmain(String[] args) {
Scannerscan = newScanner(System.in);
intq = scan.nextInt();
while (q-- > 0) {
intn = scan.nextInt();
intleap = scan.nextInt();

int[] game = newint[n];
for (inti = 0; i < n; i++) {
game[i] = scan.nextInt();
 }

System.out.println( (canWin(leap, game)) ? "YES" : "NO" );
 }
scan.close();
 }
}
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
packageDataStructure;

importjava.util.*;

publicclassJava1DArrayPart2 {

privatestaticintleap = 0;

privatestaticint[] game;

privatestaticint[] went;

privatestaticintlength;

publicstaticbooleanplay(intindex)
 {
went[index] = 1;
if (index + 1 == length && game[length] == 0) {
returntrue;
 }

if (leap > 1) {
if (index + leap > length) {
returntrue;
 }

if (game[index + leap] == 0 && went[index + leap] == 0 && play(index + leap)) {
returntrue;
 }
 }

if (game[index + 1] == 0 && went[index + 1] == 0 && play(index + 1)) {
returntrue;
 }

if (index - 1 >= 0 && game[index - 1] == 0 && went[index - 1] == 0 && play(index - 1)) {
returntrue;
 }

returnfalse;
 }

publicstaticbooleancanWin(intleap, int[] game) {
Java1DArrayPart2.went = newint[game.length];
Java1DArrayPart2.game = game;
Java1DArrayPart2.leap = leap;
Java1DArrayPart2.length = game.length - 1;

returnplay(0);
 }

publicstaticvoidmain(String[] args) {
Scannerscan = newScanner(System.in);
intq = scan.nextInt();
while (q-- > 0) {
intn = scan.nextInt();
intleap = scan.nextInt();

int[] game = newint[n];
for (inti = 0; i < n; i++) {
game[i] = scan.nextInt();
 }

System.out.println( (canWin(leap, game)) ? "YES" : "NO" );
 }
scan.close();
 }
}
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
packageDataStructure;

importjava.util.*;

publicclassJava1DArrayPart2 {

privatestaticintleap = 0;

privatestaticint[] game;

privatestaticint[] went;

privatestaticintlength;

publicstaticbooleanplay(intindex)
 {
went[index] = 1;
if (index + 1 == length && game[length] == 0) {
returntrue;
 }

if (leap > 1) {
if (index + leap > length) {
returntrue;
 }

if (game[index + leap] == 0 && went[index + leap] == 0 && play(index + leap)) {
returntrue;
 }
 }

if (game[index + 1] == 0 && went[index + 1] == 0 && play(index + 1)) {
returntrue;
 }

if (index - 1 >= 0 && game[index - 1] == 0 && went[index - 1] == 0 && play(index - 1)) {
returntrue;
 }

returnfalse;
 }

publicstaticbooleancanWin(intleap, int[] game) {
Java1DArrayPart2.went = newint[game.length];
Java1DArrayPart2.game = game;
Java1DArrayPart2.leap = leap;
Java1DArrayPart2.length = game.length - 1;

returnplay(0);
 }

publicstaticvoidmain(String[] args) {
Scannerscan = newScanner(System.in);
intq = scan.nextInt();
while (q-- > 0) {
intn = scan.nextInt();
intleap = scan.nextInt();

int[] game = newint[n];
for (inti = 0; i < n; i++) {
game[i] = scan.nextInt();
 }

System.out.println( (canWin(leap, game)) ? "YES" : "NO" );
 }
scan.close();
 }
}