class Solution {
public:
void DFS(int row,vector<vector<string>> &ret,int n)
{
if(row==n)
{
vector<string> path;
for(int i=0;i<n;i++)
{
string s(n,'.');
for(int j=0;j<n;j++)
{
if(C[i]==j)
s[j]='Q';
}
path.push_back(s);
}
ret.push_back(path);
return;
}
for(int j=0;j<n;j++)
{
bool isvalid=columns[j]==0&&maindiag[row+j]==0&&antidiag[row+n-j]==0;
if(!isvalid)
continue;
C[row]=j;
columns[j]=maindiag[row+j]=antidiag[row+n-j]=1;
DFS(row+1,ret,n);
C[row]=0;
columns[j]=maindiag[row+j]=antidiag[row+n-j]=0;
}
}
vector<vector<string> > solveNQueens(int n) {
this->columns= vector<int>(n,0);
this->maindiag=vector<int>(2*n,0);
this->antidiag=vector<int>(2*n,0);
this->C=vector<int>(n,0);
vector<vector<string>> ret;
DFS(0,ret,n);
return ret;
}
private:
vector<int> columns;
vector<int> maindiag;
vector<int> antidiag;
vector<int> C;
};
public:
void DFS(int row,vector<vector<string>> &ret,int n)
{
if(row==n)
{
vector<string> path;
for(int i=0;i<n;i++)
{
string s(n,'.');
for(int j=0;j<n;j++)
{
if(C[i]==j)
s[j]='Q';
}
path.push_back(s);
}
ret.push_back(path);
return;
}
for(int j=0;j<n;j++)
{
bool isvalid=columns[j]==0&&maindiag[row+j]==0&&antidiag[row+n-j]==0;
if(!isvalid)
continue;
C[row]=j;
columns[j]=maindiag[row+j]=antidiag[row+n-j]=1;
DFS(row+1,ret,n);
C[row]=0;
columns[j]=maindiag[row+j]=antidiag[row+n-j]=0;
}
}
vector<vector<string> > solveNQueens(int n) {
this->columns= vector<int>(n,0);
this->maindiag=vector<int>(2*n,0);
this->antidiag=vector<int>(2*n,0);
this->C=vector<int>(n,0);
vector<vector<string>> ret;
DFS(0,ret,n);
return ret;
}
private:
vector<int> columns;
vector<int> maindiag;
vector<int> antidiag;
vector<int> C;
};