回溯法模板:
void backtracking(参数){
if(终止条件){
收集结果;
return;
}
for(选择:本层集合中的元素(树中节点孩子的数量就是集合大小)){
处理节点;
backtracking(路径,选择列表);
回溯,撤销处理结果;
}
}
题解:
public List<List<String>> solveNQueens(int n) {
List<List<String>> result = new ArrayList<>();
List<char[]> board = new ArrayList<>();
for (int i = 0; i < n; i++) {
char[] chars = new char[n];
Arrays.fill(chars,'.');
board.add(chars);
}
backtracking(n,0,board,result);
return result;
}
private void backtracking(int n, int row, List<char[]> board, List<List<String>> result) {
if (n == row){
List<String> path = new ArrayList<>();
for (char[] chars : board) {
path.add(new String(chars));
}
result.add(path);
return;
}
for (int col = 0; col < n; col++) {
if (isValid(row,col,n,board)){
board.get(row)[col] = 'Q';
backtracking(n,row+1,board,result);
board.get(row)[col]='.';
}
}
}
private boolean isValid(int row, int col, int n, List<char[]> board) {
for (int i = 0; i < row; i++) {
if (board.get(i)[col] == 'Q'){
return false;
}
}
for (int i = row - 1,j = col - 1; i >= 0 && j >= 0 ; i--,j--) {
if (board.get(i)[j] == 'Q'){
return false;
}
}
for (int i = row - 1,j = col + 1;i >= 0 && j < n;i--,j++){
if (board.get(i)[j] == 'Q'){
return false;
}
}
return true;
}
感谢Carl,公众号:代码随想录