[Leetcode] 51. N-Queens N皇后问题（DFS）

最新推荐文章于 2022-07-23 23:29:50 发布

Haskei

最新推荐文章于 2022-07-23 23:29:50 发布

阅读量198

点赞数

分类专栏： LeetCode DFS

本文链接：https://blog.csdn.net/Haskei/article/details/107976948

版权

LeetCode DFS 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

51. N-Queens (题目链接)

Hard

The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.

Given an integer n, return all distinct solutions to the n-queens puzzle.

Each solution contains a distinct board configuration of the n-queens' placement, where 'Q'and '.' both indicate a queen and an empty space respectively.

Example:

Input: 4
Output: [
 [".Q..",  // Solution 1
  "...Q",
  "Q...", 
  "..Q."],

 ["..Q.",  // Solution 2
  "Q...",
  "...Q",
  ".Q.."]
]
Explanation: There exist two distinct solutions to the 4-queens puzzle as shown above.

class Solution:
    def solveNQueens(self, n: int) -> List[List[str]]:
        rlt = []
        maze = [0] * n
        def check(row):
            for i in range(row):
                if maze[row] == maze[i] or (row - i) == abs(maze[row] - maze[i]):
                    return False
            return True
        
        def dfs(row):
            if row == n:
                puz = ['.' * maze[i] + 'Q' + '.' * (n - 1 - maze[i]) for i in range(n)]
                rlt.append(puz)
                return
            for col in range(n):
                maze[row] = col
                if check(row):
                    dfs(row + 1)
        dfs(0)
        return rlt