Divisor Game

Solution.cs

// https://leetcode.com/problems/divisor-game/
public class Solution {
    
    public enum Player { Alice = 1, Bob= 2 }
    private const int X = 1;
    
    public bool DivisorGame(int n) {
        return WhoLooses(Player.Alice, n) != Player.Alice;
    }
    
    
    public Player WhoLooses(Player playerTurn, int n)
    {
        if(X > 0 && X < n)
        {
            if(playerTurn == Player.Alice)
            {
                return WhoLooses(Player.Bob, n - X);
            }
            else
            {
                return WhoLooses(Player.Alice, n - X);
            }
        }
        else
        {
            return playerTurn;
        }
    }
}