<p>The <strong>n-queens</strong> puzzle is the problem of placing <code>n</code> queens on an <code>n x n</code> chessboard such that no two queens attack each other.</p>

<p>Given an integer <code>n</code>, return <em>all distinct solutions to the <strong>n-queens puzzle</strong></em>. You may return the answer in <strong>any order</strong>.</p>

<p>Each solution contains a distinct board configuration of the n-queens&#39; placement, where <code>&#39;Q&#39;</code> and <code>&#39;.&#39;</code> both indicate a queen and an empty space, respectively.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/11/13/queens.jpg" style="width: 600px; height: 268px;" />
<pre>
<strong>Input:</strong> n = 4
<strong>Output:</strong> [[&quot;.Q..&quot;,&quot;...Q&quot;,&quot;Q...&quot;,&quot;..Q.&quot;],[&quot;..Q.&quot;,&quot;Q...&quot;,&quot;...Q&quot;,&quot;.Q..&quot;]]
<strong>Explanation:</strong> There exist two distinct solutions to the 4-queens puzzle as shown above
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> n = 1
<strong>Output:</strong> [[&quot;Q&quot;]]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= n &lt;= 9</code></li>
</ul>

class Solution {
private:
    void solve(int r, map<int,bool> col, map<int,bool> posdiag, map<int,bool> negdiag, vector<vector<string>>& ans,vector<string> board, int n){
        if(r == n){
            ans.push_back(board);
            return;
        }
        for(int i = 0; i < n; i++){
            if(col[i] || posdiag[r+i] || negdiag[r-i]) continue;
            col[i] = true;
            posdiag[r+i] = true;
            negdiag[r-i] = true;
            board[r][i] = 'Q';
            solve(r+1,col,posdiag,negdiag,ans,board,n);
            col[i] = false;
            posdiag[r+i] = false;
            negdiag[r-i] = false;
            board[r][i] = '.';
        }
    }
public:
    vector<vector<string>> solveNQueens(int n) {
        map<int,bool> col;
        map<int,bool> posdiag;
        map<int,bool> negdiag;
        vector<vector<string>> ans;
        vector<string> board(n, string(n,'.'));
        solve(0,col,posdiag,negdiag,ans,board,n);
        return ans;
    }
};
45803