[LeetCode 解题报告]051. N-Queens

最新推荐文章于 2022-03-06 11:37:00 发布

caicaiatnbu

最新推荐文章于 2022-03-06 11:37:00 发布

阅读量80

点赞数

分类专栏： LeetCode 解题报告

本文链接：https://blog.csdn.net/caicaiatnbu/article/details/102927096

版权

LeetCode 解题报告专栏收录该内容

154 篇文章 5 订阅

订阅专栏

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.

考察：N皇后问题，经典回溯问题；判断每行位置的位置，能放则放；不能与前边行，同行或者同列或者在对角线上；

class Solution {
public:
    vector<vector<string>> solveNQueens(int n) {
        vector<vector<string>> res;
        vector<int> pos(n, -1);
        solveNQueensDFS(pos, 0, res);
        return res;
    }
    
    void solveNQueensDFS(vector<int> &pos, int row, vector<vector<string>> &res) {
        int n = pos.size();
        if (row == n) {
            vector<string> out(n, string(n, '.'));
            for (int i = 0; i < n; i ++)
                out[i][pos[i]] = 'Q';
            res.push_back(out);
        }
        else {
            for (int col = 0; col < n; col ++) {
                if (isValid(pos, row, col)) {
                    pos[row] = col;
                    solveNQueensDFS(pos, row+1, res);
                    pos[row] = -1;
                }
            }
        }
    }
    
    bool isValid(vector<int> &pos, int row, int col) {
        for (int i = 0; i < row; i ++) {
            if(col == pos[i] || abs(row-i) == abs(pos[i]-col))
                return false;
        }
        return true;
    }
};