leetcode_62 N-Queens

最新推荐文章于 2024-10-01 05:04:32 发布

Maria21

最新推荐文章于 2024-10-01 05:04:32 发布

阅读量99

点赞数

分类专栏：刷题 C/C++ 文章标签： leetcode c++

本文链接：https://blog.csdn.net/SSJJRRRR/article/details/107619715

版权

C/C++ 同时被 2 个专栏收录

192 篇文章 1 订阅

订阅专栏

刷题

161 篇文章 0 订阅

订阅专栏

题目：N皇后

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，每次加深一行，candidate为改行的每个列；

每个位置的约束条件为 px ！= x && py = y && abs(px - x) != abs(py - y) ,(px,py)表示，已经放置皇后的位置，表示不能同行，同列，同斜线

结果的构造也比较复杂，vector<vector<string> >, 详见代码：

class Solution {
public:
    bool isValidQueen(vector<pair<int,int> > &QueenPos, int x, int y)
    {
        for(auto e : QueenPos)
        {
            int px = e.first;
            int py = e.second;
            
            if(px == x || py == y || abs(px - x) == abs(py - y))
                return false;
        }
        return true;
    }
    
    void dfs(vector<vector<pair<int,int> > >&res,vector<pair<int,int> >&queenPos,int row,int n)
    {
        if(row >= n )
        {
            if(row == n)
                res.push_back(queenPos);
            return;
        }
        for(int j = 0; j < n; j++)
        {
            if(true == isValidQueen(queenPos,row,j))
            {   
                queenPos.push_back(make_pair(row,j));
                dfs(res,queenPos,row + 1,n);
                queenPos.pop_back();
            }
        }
    }
    
    vector<vector<string>> solveNQueens(int n) {
        vector<pair<int,int> > queenPos;
        vector<vector<pair<int,int> > > res;
        int row = 0;
        queenPos.clear();
        dfs(res,queenPos,row,n);
        
        vector<vector<string> > ans;
        for(auto e: res)
        {
            vector<string> str1(n,string(n,'.'));
            for(auto pos: e)
            {
                str1[pos.first][pos.second] = 'Q' ;
            }
            ans.push_back(str1);
        }
        return  ans;
    }
};