思路
- 先读懂题目,任意两个皇后不能在同一列,同一行,同一对角线
- 使用回溯,如果棋子无法放到最后一个,拿走棋子
- 按照行进行放置,则皇后不能在同一列,同一正对角线,同一副对角线
- 利用三个集合进行快速查找位置是否被占用——同一正对角线相减值相等,同一副对角线相加值相等
- 对棋盘结果进行转换—— 先置全0 再定位置Q
代码
步骤:
1. 申请存储空间
2. 第一行放置,第二行放置...
3. 判断是否冲突(三个集合)
4. 若不冲突,更新答案数组,三个集合
5. 若未走到结尾,进行回溯,即拿掉棋子(与放置棋子为相反操作)
6. 若走到结尾,答案数组形式转换
class Solution {
public:
vector<vector<string>> solveNQueens(int n) {
auto solutions = vector<vector<string>>();
auto queens = vector<int>(n, -1);
auto columns = unordered_set<int>();
auto diagonals1 = unordered_set<int>();
auto diagonals2 = unordered_set<int>();
backtrack(solutions, queens, n, 0, columns, diagonals1, diagonals2);
return solutions;
}
void backtrack(vector<vector<string>> &solutions, vector<int> &queens, int n, int row, unordered_set<int> &columns, unordered_set<int> &diagonals1, unordered_set<int> &diagonals2) {
if (row == n) {
vector<string> board = generateBoard(queens, n);
solutions.push_back(board);
}
else {
for (int i = 0; i < n; ++i) {
if (columns.find(i) != columns.end())
continue;
int diagonal1 = row - i;
if (diagonals1.find(diagonal1) != diagonals1.end())
continue;
int diagonal2 = row + i;
if (diagonals2.find(diagonal2) != diagonals2.end())
continue;
queens[row] = i;
columns.insert(i);
diagonals1.insert(diagonal1);
diagonals2.insert(diagonal2);
backtrack(solutions, queens, n, row + 1, columns, diagonals1, diagonals2);
queens[row] = -1;
columns.erase(i);
diagonals1.erase(diagonal1);
diagonals2.erase(diagonal2);
}
}
}
vector<string> generateBoard(vector<int> &queens, int n) {
auto board=vector<string>();
for (int i = 0; i < n; ++i) {
string row = string(n, '.');
row[queens[i]] = 'Q';
board.push_back(row);
}
return board;
}
};