We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Game Theory
  4. Game of Stones
  5. Discussions

Game of Stones

  • emhhacker
     + 0 comments

    My Java solution with linear time and space complexity

    public static String gameOfStones(int n) {
        // goal: print the name of the winner
        if(n == 1) return "Second";
        
        boolean[] moves = new boolean[n + 1];
        
        moves[0] = false;
        for(int i = 1; i <= n; i++){
            boolean canWin = false;
            
            if (i >= 2 && !moves[i - 2]) canWin = true;
            if (i >= 3 && !moves[i - 3]) canWin = true;
            if (i >= 5 && !moves[i - 5]) canWin = true;

            moves[i] = canWin;
        }
        
        return moves[n] ? "First" : "Second";
    }