def totalNQueens(self, n):
"""
:type n: int
:rtype: int
"""
matrix = [['.'] * n for _ in range(n)]
res = []
self.count = 0
def help(matrix,r,c,n):
for i in range(r):
if matrix[i][c] == "Q":
return 0
i,j = r-1,c+1
while i >= 0 and j < n:
if matrix[i][j] == "Q":
return 0
i -= 1
j += 1
i,j = r-1,c-1
while i >= 0 and j >= 0:
if matrix[i][j] =="Q":
return 0
i -= 1
j -= 1
return 1
def backtrack(matrix,r,c,n):
if r == n:
self.count += 1
for c in range(n):
if help(matrix,r,c,n) == 0:
continue
matrix[r][c] = "Q"
backtrack(matrix,r+1,c,n)
matrix[r][c] = "."
backtrack(matrix,0,0,n)
return self.count
07-19
268
07-23
349