n-queens

最新推荐文章于 2024-10-13 18:33:13 发布

llwjason5555

最新推荐文章于 2024-10-13 18:33:13 发布

阅读量168

点赞数

分类专栏： leetcode 文章标签： leetcode 递归

本文链接：https://blog.csdn.net/llwjason5555/article/details/77978872

版权

leetcode 专栏收录该内容

116 篇文章 0 订阅

订阅专栏

题目：

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.

For example,
There exist two distinct solutions to the 4-queens puzzle:

[
 [".Q..",  // Solution 1
  "...Q",
  "Q...",
  "..Q."],

 ["..Q.",  // Solution 2
  "Q...",
  "...Q",
  ".Q.."]
]

class Solution {
public:
    vector<vector<string> > solveNQueens(int n) {
        string str;
        for(int i=0;i<n;i++)
            str.push_back('.');
        vector<string> vec;
        int a[n];
        for(int i=0;i<n;i++)
            vec.push_back(str);
        vector<vector<string> > res;
        Back(n,0,res,vec,a);
        return res;
    }
     
    void Back(int n,int t,vector<vector<string> > &res,vector<string> vec,int *a)
    {
        if(n == t)
        {
            res.push_back(vec);
            return;
        }
        for(int i=0;i<n;i++)
        {
            a[t] = i;
            if(Push(t,a))
            {
                vec[t][i] = 'Q';
                Back(n,t+1,res,vec,a);
                vec[t][i] = '.';
            }
        }
    }
     
    bool Push(int m,int a[])
    {
        bool flag = true;
        for(int i=0;i<m;i++)
        {
            if(a[i] == a[m] || abs(a[m]-a[i]) == (m-i))
            {
                flag = false;
                break;
            }
        }
        return flag;
    }
};

点评：

N皇后不能再一条直线，不能对角，即坐标绝对值不能相等，递归求解