class Solution: def Nqueen(self, n): def dfs(i, j, n): if i == n: self.res += 1 return for j in range(j, n): if isok(i, j): dp[i][j] = 'Q' dfs(i + 1, 0, n) ...