1510. Stone Game IV

class Solution {
    public boolean winnerSquareGame(int n) {
        boolean[] dp = new boolean[n + 1];
        for (int i = 1; i <= n; i++) {
            for (int k = 1; k * k <= i; k++) {
                if (!dp[i - k * k]) {
                    dp[i] = true;
                    break;
                }
            }
        }
        return dp[n];
    }
}

class Solution:
    def winnerSquareGame(self, n):
        dp = [False] * (n + 1)

        for i in range(1, n + 1):
            k = 1

            while k * k <= i:
                if not dp[i - k * k]:
                    dp[i] = True
                    break
                k += 1

        return dp[n]

class Solution {
public:
    bool winnerSquareGame(int n) {
        vector<bool> dp(n + 1, false);

        for (int i = 1; i <= n; i++) {
            for (int k = 1; k * k <= i; k++) {
                if (!dp[i - k * k]) {
                    dp[i] = true;
                    break;
                }
            }
        }

        return dp[n];
    }
};

class Solution {
    winnerSquareGame(n) {
        const dp = new Array(n + 1).fill(false);

        for (let i = 1; i <= n; i++) {
            for (let k = 1; k * k <= i; k++) {
                if (!dp[i - k * k]) {
                    dp[i] = true;
                    break;
                }
            }
        }

        return dp[n];
    }
}