跟上一题做法一样,这里不在求所有的答案,而是要答案的个数,所以只需要在上一题的基础上稍加修改,加一个count来计数就可以。
class Solution {
public:
int count;
int totalNQueens(int n) {
count = 0;
vector<string> matrix(n, string(n, '.'));
backtracking(0, n, matrix);
return count;
}
void backtracking(int row, int n, vector<string>& matrix)
{
if(row == n){
count++;
return ;
}
for (int i = 0; i < n; ++i)
{
if(isValid(row, i ,matrix)){
matrix[row][i] = 'Q';
backtracking(row + 1, n, matrix);
matrix[row][i] = '.';
}
}
}
bool isValid(int x, int y, vector<string> matrix)
{
for (int i = 0; i != x; ++i)
if (matrix[i][y] == 'Q')
return false;
//check if the 45?diagonal had a queen before.
for (int i = x - 1, j = y - 1; i >= 0 && j >= 0; --i, --j)
if (matrix[i][j] == 'Q')
return false;
//check if the 135?diagonal had a queen before.
for (int i = x - 1, j = y + 1; i >= 0 && j < matrix.size(); --i, ++j)
if (matrix[i][j] == 'Q')
return false;
return true;
}
};