52. N-Queens II(Leetcode每日一题-2020.10.17)

Problem

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 the number of distinct solutions to the n-queens puzzle.

Example

Input: 4
Output: 2
Explanation: There are two distinct solutions to the 4-queens puzzle as shown below.
[
[".Q…", // Solution 1
“…Q”,
“Q…”,
“…Q.”],
["…Q.", // Solution 2
“Q…”,
“…Q”,
“.Q…”]
]

Solution

class Solution {
public:
    int totalNQueens(int n) {
        int ret = 0;
        //vector<string> cur_conf;
        vector<bool> col_used(n,false);
        vector<bool> dg_used(2 * n - 1,false);
        vector<bool> udg_used(2 * n - 1,false);
        dfs(ret,col_used,dg_used,udg_used,0,n);

        return ret;
        
    }

    void dfs(int &ret,vector<bool> &col_used,vector<bool> &dg_used,vector<bool> & udg_used,int row,int n)
    {
        if(row == n)
        {
            ++ret;
            return;
        }

        string row_conf(n,'.');
        for(int i = 0;i<n;++i)
        {
            if(! col_used[i] && !dg_used[row + i] && !udg_used[i-row + n] )
            {
                col_used[i] = dg_used[row + i] = udg_used[i - row + n] = true;
                row_conf[i] = 'Q';
                //cur_conf.push_back(row_conf);
                dfs(ret,col_used,dg_used,udg_used,row+1,n);
                //cur_conf.pop_back();
                row_conf[i] = '.';
                col_used[i] = dg_used[row + i] = udg_used[i - row + n] = false;
            }
        }
    }
};