leetcode51/52-N-Queens I/II（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.

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

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

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

N皇后问题：放置n的皇后在n*n的棋盘上，使其任意两个皇后不能相互攻击。给定整数n，返回所有可能情况，其中‘Q’表示皇后，‘.’表示空位置。

两个皇后不能相互攻击，即要求这两个皇后不在同一行、同一列及同一斜线上。

问题求解：

一行一行的遍历，找放置位置。如果该行放置在当前列不与前面的放法产生冲突（不在同一列、不在同一斜线），则回溯法接着递归。遍历n行后，将当前的方案加入到结果数组。

class Solution {
    vector<vector<string> > res;
public:
    vector<vector<string>> solveNQueens(int n) {
        vector<string> nQueen(n, string(n, '.'));
        solve(nQueen,n, 0);
        return res;
    }
    void solve(vector<string> nQueen, int n, int row)
    {
        if(row == n)
        {
            res.push_back(nQueen);
            return;
        }
        for(int col=0;col<n;++col)
        {
            if(isValid(nQueen, row, col, n))
            {
                nQueen[row][col] = 'Q';
                solve(nQueen, n, row+1);
                nQueen[row][col] = '.';
            }
        }
    }
    bool isValid(vector<string> nQueen, int row, int col, int n)
    {
        //检查是否在同一列
        for (int i = 0; i < row; ++i)
            if (nQueen[i][col] == 'Q')
                return false;
        //检查左斜线
        for (int i = row - 1, j = col - 1; i >= 0 && j >= 0; --i, --j)
            if (nQueen[i][j] == 'Q')
                return false;
        //检查右斜线
        for (int i = row - 1, j = col + 1; i >= 0 && j < n; --i, ++j)
            if (nQueen[i][j] == 'Q')
                return false;
        return true;
    }
};

N-Queens II 问题描述：

最后返回总的方案数。

class Solution {
    int res=0;
public:
    int totalNQueens(int n) {
        vector<string> nQueen(n, string(n, '.'));
        solve(nQueen,n, 0);
        return res;
    }
    void solve(vector<string> nQueen, int n, int row)
    {
        if(row == n)
        {
            res++;
            return;
        }
        for(int col=0;col<n;++col)
        {
            if(isValid(nQueen, row, col, n))
            {
                nQueen[row][col] = 'Q';
                solve(nQueen, n, row+1);
                nQueen[row][col] = '.';
            }
        }
    }
    bool isValid(vector<string> nQueen, int row, int col, int n)
    {
        //检查是否在同一列
        for (int i = 0; i < row; ++i)
            if (nQueen[i][col] == 'Q')
                return false;
        //检查左斜线
        for (int i = row - 1, j = col - 1; i >= 0 && j >= 0; --i, --j)
            if (nQueen[i][j] == 'Q')
                return false;
        //检查右斜线
        for (int i = row - 1, j = col + 1; i >= 0 && j < n; --i, ++j)
            if (nQueen[i][j] == 'Q')
                return false;
        return true;
    }
};