Leetcode 51

//看了一次解析后，一次AC，用一个pos记录行列。
class Solution {
public:
    vector<vector<string>> solveNQueens(int n) {
        vector<vector<string>> res;
        vector<int> pos(n,-);
        DFS(pos,,res);
        return res;
    }

    void DFS(vector<int>& pos,int row,vector<vector<string>>& res){
        int n = pos.size();
        if(row == n){
            vector<string> out(n,string(n,'.')); //string也有这种填充写法
            for(int i=;i < n;i++){
                out[i][pos[i]] = 'Q';
            }
            res.push_back(out);
        }
        else{
            for(int i=;i < n;i++){
                if(isfine(pos,row,i)){
                    pos[row] = i;
                    DFS(pos,row+,res);
                    pos[row] = -;
                }
            }
        }
    }

    bool isfine(vector<int>& pos,int row,int col){
        for(int i=;i < row;i++){
            if(pos[i] == col || abs(row-i) == abs(col-pos[i]))
                return false;
        }
        return true;
    }
};