N-Queens

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.."]
]

/* n皇后问题： backtracking
 * 递归回溯 写一个判断当前情况是否合法的函数  合理则push入答案
 * */
class Solution {
public:
    // 四个方向分别检查 * 没必要  循环时显然不在同一行(一行只下一个) 只要check 和下过的位置是否冲突 即：上面的列 左上角和右上角
    bool vaild(const vector<vector<bool>> &board, int i, int j, int n){
        for(int row=i-1;row>=0;row--){
            if(board[row][j])   return false;
        }
        for(int row=i-1,col=j-1;row>=0 && col>=0;row--,col--){
            if(board[row][col]) return false;
        }
        for(int row=i-1,col=j+1;row>=0 && col<n;row--,col++){
            if(board[row][col]) return false;
        }
        return true;
    }
    void solver(vector<vector<string>> &ret, vector<vector<bool>> &board, int k, int &n){
        if(k==n){
            vector<string> tmp;
            for(auto &row : board){
                string str="";
                for(auto col : row){
                    str += col ? "Q" : ".";
                }
                tmp.push_back(str);
            }
            ret.push_back(tmp);
        }
        else{
            for(int j=0;j<n;j++){
                if(vaild(board, k, j, n)){
                    board[k][j] = true;
                    solver(ret, board, k+1, n);
                    board[k][j] = false;
                }
            }
        }
    }
    vector<vector<string>> solveNQueens(int n) {
        vector<vector<bool>> board(n, vector<bool>(n, false));
        vector<vector<string>> ret;
        solver(ret, board, 0, n);
        return ret;
    }
};