【LeetCode 51】 N-Queens

最新推荐文章于 2022-06-06 22:03:40 发布

涛涛酱

最新推荐文章于 2022-06-06 22:03:40 发布

阅读量89

点赞数

分类专栏： LeetCode 搜索

本文链接：https://blog.csdn.net/iCode_girl/article/details/104774710

版权

LeetCode 同时被 2 个专栏收录

295 篇文章 0 订阅

订阅专栏

搜索

88 篇文章 0 订阅

订阅专栏

本文探讨了N皇后问题，这是一个经典的回溯算法案例。目标是在N×N的棋盘上放置N个皇后，使得任意两个皇后都不会互相攻击。通过深度优先搜索(DFS)算法，寻找所有可能的解决方案，并以字符串矩阵形式展示每种布局。

摘要由CSDN通过智能技术生成

题目描述

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.

思路

dfs。开始没看图，这个check()函数写了很久。。

代码

class Solution {
public:
    vector<vector<string>> solveNQueens(int n) {
        vector<string> res(n);
        string tmp = "";
        for (int i=0; i<n; ++i) tmp += ".";
        for (int i=0; i<n; ++i) res[i] = tmp;
        
        vector<vector<int>> vis(n, vector<int>(n, 0));
        dfs(n, 0, vis, res);
        return ans;
    }
    

private:
    vector<vector<string>> ans;

    void dfs(int n, int cur, vector<vector<int>>& vis, vector<string>& res) {
        if (cur == n) ans.push_back(res);
        for (int i=0; i<n; ++i) {
            bool tmp = check(n, cur, i, vis);
            if (!check(n, cur, i, vis)) continue;
            vis[cur][i] = 1;
            res[cur][i] = 'Q';
            dfs(n, cur+1, vis, res);
            vis[cur][i] = 0;
            res[cur][i] = '.';
        }
        return;
    } 
    
    bool check(int n, int x, int y, vector<vector<int>>& vis) {
        int sum = x+y;
        for (int i=0; i<x; ++i) {
            if (vis[i][y] == 1) return false; 
        }
        
        for (int i=0; i<x; ++i) {
            if (sum-i >= 0 && sum-i < n && vis[i][sum-i] == 1) return false; 
        }
        
        int tx = x, ty = y;
        while(tx >= 0 && tx < n && ty >= 0 && ty < n) {
            if (vis[tx][ty] == 1) return false;
            tx -= 1;
            ty -= 1;
        } 
        return true;
    }
};