LC51. N 皇后

此处需要注意的是因为答案其实是在矩阵里，回溯也是回溯的矩阵。所以在append的时候，每次要把前一个sol给置为空。

class Solution(object):
    def solveNQueens(self, n):
        """
        :type n: int
        :rtype: List[List[str]]
        """
        matrix = [['.'] * n for _ in range(n)]
        res = []
        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:
                sol=[]
                for i in matrix:
                    x = "".join(i)
                    sol.append(x)
                res.append(sol)
            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 res