HR자바 Java 1D Array (Part 2)

개요

HR자바 Java 1D Array (Part 2)

• https://www.hackerrank.com/challenges/java-1d-array/problem

해커랭크 Java

#	문제	비고
HR자바 Data Structures e
28	HR자바 Java 1D Array
29	HR자바 Java 2D Array
30	HR자바 Java Subarray
31	HR자바 Java Arraylist
32	HR자바 Java 1D Array (Part 2)
33	HR자바 Java List
34	HR자바 Java Map
35	HR자바 Java Stack
36	HR자바 Java Hashset
37	HR자바 Java Generics
38	HR자바 Java Comparator
39	HR자바 Java Sort
40	HR자바 Java Dequeue
41	HR자바 Java BitSet
42	HR자바 Java Priority Queue

---

import java.util.*;

public class Solution {

    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[] game, int pos) {
        if( pos < 0 ) return false;
        if( game[pos] == 1 ) return false;
        if( pos+leap >= game.length ) return true;
        if( pos+1 >= game.length ) return true;
        game[pos] = 1;
        return canWin(leap, game, pos+leap)
            || canWin(leap, game, pos+1)
            || canWin(leap, game, pos-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();
    }
}