N-Queens II

class Solution {
public:
int totalNQueens(int n) {
if(n<=0) return 0;
int result=0;
vector<int> table(n,0);
next(n,table,0,result);
return result;
}
void next(const int n,vector<int> &table,const int curRow,int &result)
{
for(int i=0;i<n;i++)
{
int j=0;
for(;j<curRow;j++)
{
if(i==table[j] || abs(i-table[j])==(curRow-j))
break;
}
if(j==curRow)
{
if(curRow!=n-1)
{
table[curRow]=i;
next(n,table,curRow+1,result);
}
else
{
result++;
return;
}
}
}
return;
}
};