leetcode 51. N 皇后 52. N皇后 II

leetcode 51. N 皇后 52. N皇后 II

51. N 皇后

难度困难1087收藏分享切换为英文接收动态反馈

n 皇后问题 研究的是如何将 n 个皇后放置在 n×n 的棋盘上，并且使皇后彼此之间不能相互攻击。

给你一个整数 n ，返回所有不同的 n 皇后问题 的解决方案。

每一种解法包含一个不同的 n 皇后问题 的棋子放置方案，该方案中 'Q' 和 '.' 分别代表了皇后和空位。

示例 1：

输入：n = 4
输出：[[".Q..","...Q","Q...","..Q."],["..Q.","Q...","...Q",".Q.."]]
解释：如上图所示，4 皇后问题存在两个不同的解法。

示例 2：

输入：n = 1
输出：[["Q"]]

提示：

• 1 <= n <= 9
• 皇后彼此不能相互攻击，也就是说：任何两个皇后都不能处于同一条横行、纵行或斜线上。

通过次数162,527

提交次数220,309

#  Related Topics 数组 回溯 👍 1069 👎 0


# leetcode submit region begin(Prohibit modification and deletion)
import time
from typing import List


class Solution:
    def solveNQueens(self, n: int) -> List[List[str]]:
        m = [["." for i in range(n)] for _ in range(n)]
        ans = []
        selected_row = []
        selected_col = []
        selected_left = []
        selected_right = []
        def dfs(r,c,n):
            for i in range(r, len(m)):
                if i in selected_row:continue
                for j in range(c, len(m)):
                    if j in selected_col:continue
                    if i - j in selected_left:continue
                    if i + j in selected_right:continue
                    m[i][j] = "Q"
                    selected_col.append(j)
                    selected_row.append(i)
                    selected_left.append(i-j)
                    selected_right.append(i+j)
                    f = dfs(i + 1, 0, n - 1)
                    if f:
                        ans.append(["".join(m[k]) for k in range(len(m))])
                    m[i][j] = "."
                    selected_col.pop()
                    selected_row.pop()
                    selected_left.pop()
                    selected_right.pop()
                    if f:
                        return False

                return False
            if n == 0:
                return True
            return False
        dfs(0,0,n)
        return ans

    def solveNQueens4(self, n: int) -> List[List[str]]:
        m = [["." for i in range(n)] for _ in range(n)]
        ans = []
        selected_row = []
        selected_col = []
        selected_left = []
        selected_right = []
        def findQ(row, col):
            flag = False
            if "Q" in m[row] or "Q" in [m[i][col] for i in range(n)]:
                flag = True
            for i in range(n):
                if 0 <= row - i - 1 < n:
                    if 0 <= col - i -1 < n:
                        if m[row - i - 1][col - i - 1] == "Q":
                            flag = True
                    if 0 <= col + i + 1 < n:
                        if m[row - i - 1][col + i + 1] == "Q":
                            flag = True
                if 0 <= row + i + 1 < n:
                    if 0 <= col - i - 1 < n:
                        if m[row + i + 1][col - i - 1] == "Q":
                            flag = True
                    if 0 <= col + i + 1 < n:
                        if m[row + i + 1][col + i + 1] == "Q":
                            flag = True
            return flag
        def dfs(r,c,n):
            for i in range(r, len(m)):
                if i in selected_row:continue
                for j in range(c, len(m)):
                    if j in selected_col:continue
                    if i - j in selected_left:continue
                    if i + j in selected_right:continue
                    if not findQ(i, j):
                        m[i][j] = "Q"
                        selected_col.append(j)
                        selected_row.append(i)
                        selected_left.append(i-j)
                        selected_right.append(i+j)
                        if not dfs(i + 1, 0, n - 1):
                            m[i][j] = "."
                            selected_col.pop()
                            selected_row.pop()
                            selected_left.pop()
                            selected_right.pop()
                        else:
                            ans.append(["".join(m[k]) for k in range(len(m))])
                            m[i][j] = "."
                            selected_col.pop()
                            selected_row.pop()
                            selected_left.pop()
                            selected_right.pop()
                            return False

                return False
            if n == 0:
                return True
            return False
        dfs(0,0,n)
        return ans

    def solveNQueens3(self, n: int) -> List[List[str]]:
        m = [[ "." for i in range(n)] for _ in range(n)]
        ans = []
        selected_row = []
        selected_col = []
        def findQ(row, col):
            flag = False
            if "Q" in m[row] or "Q" in [m[i][col] for i in range(n)]:
                flag = True
            for i in range(n):
                if 0 <= row - i - 1 < n:
                    if 0 <= col - i -1 < n:
                        if m[row - i - 1][col - i - 1] == "Q":
                            flag = True
                    if 0 <= col + i + 1 < n:
                        if m[row - i - 1][col + i + 1] == "Q":
                            flag = True
                if 0 <= row + i + 1 < n:
                    if 0 <= col - i - 1 < n:
                        if m[row + i + 1][col - i - 1] == "Q":
                            flag = True
                    if 0 <= col + i + 1 < n:
                        if m[row + i + 1][col + i + 1] == "Q":
                            flag = True
            return flag
        def dfs(r,c,n):
            for i in range(r, len(m)):
                if i in selected_row:continue
                for j in range(c, len(m)):
                    if j in selected_col:continue
                    if not findQ(i, j):
                        m[i][j] = "Q"
                        selected_col.append(j)
                        selected_row.append(i)
                        if not dfs(i + 1, 0, n - 1):
                            m[i][j] = "."
                            selected_col.pop()
                            selected_row.pop()
                        else:
                            ans.append(["".join(m[k]) for k in range(len(m))])
                            m[i][j] = "."
                            selected_col.pop()
                            selected_row.pop()
                            return False
                c = 0
            if n == 0:
                return True
            return False
        dfs(0,0,n)
        return ans


# leetcode submit region end(Prohibit modification and deletion)
if __name__ == '__main__':
    start = time.time()
    #0.018012285232543945
    #0.01998424530029297
    #0.019017934799194336
    #0.017991065979003906
    #0.01799488067626953
    print(len(Solution().solveNQueens(9)))
    end = time.time()
    print((end-start))

52. N皇后 II

难度困难315收藏分享切换为英文接收动态反馈

n 皇后问题 研究的是如何将 n 个皇后放置在 n×n 的棋盘上，并且使皇后彼此之间不能相互攻击。

给你一个整数 n ，返回 n 皇后问题 不同的解决方案的数量。

示例 1：

输入：n = 4
输出：2
解释：如上图所示，4 皇后问题存在两个不同的解法。

示例 2：

输入：n = 1
输出：1

提示：

• 1 <= n <= 9
• 皇后彼此不能相互攻击，也就是说：任何两个皇后都不能处于同一条横行、纵行或斜线上。

通过次数77,194

提交次数93,920

# -*- coding: utf-8 -*-
# !/usr/bin/env python
# @Time    : 2021/11/17 16:52 
# @Author  : mtl
# @Desc    : ***
# @File    : 52.py
# @Software: PyCharm
import time


class Solution:
    def totalNQueens(self, n: int) -> int:
        m = [["." for i in range(n)] for _ in range(n)]
        ans = 0
        selected_row = []
        selected_col = []
        selected_left = []
        selected_right = []
        def dfs(r,c,n):
            nonlocal ans
            for i in range(r, len(m)):
                if i in selected_row:continue
                for j in range(c, len(m)):
                    if j in selected_col:continue
                    if i - j in selected_left:continue
                    if i + j in selected_right:continue
                    m[i][j] = "Q"
                    selected_col.append(j)
                    selected_row.append(i)
                    selected_left.append(i-j)
                    selected_right.append(i+j)
                    f = dfs(i + 1, 0, n - 1)
                    m[i][j] = "."
                    selected_col.pop()
                    selected_row.pop()
                    selected_left.pop()
                    selected_right.pop()
                    if f:
                        ans += 1
                        return False

                return False
            if n == 0:
                return True
            return False
        dfs(0,0,n)
        return ans

if __name__ == '__main__':
    start = time.time()
    print(Solution().totalNQueens(9))
    end = time.time()
    print((end-start))

eturn False

            return False
        if n == 0:
            return True
        return False
    dfs(0,0,n)
    return ans

if name == ‘main’:
start = time.time()
print(Solution().totalNQueens(9))
end = time.time()
print((end-start))