题目链接:. - 力扣(LeetCode)
这道题的解法还是套用回溯算法的模板。个人认为的难点在于对题目的理解,和校验棋子摆放位置是否符合规则。
个人理解如果以后碰到需要嵌套N层for循环的题目,可以选择回溯算法。
class Solution {
private List<List<String>> res = new ArrayList<>();
public List<List<String>> solveNQueens(int n) {
char[][] cheesBoard = new char[n][n];
for(char[] chars:cheesBoard){
Arrays.fill(chars,'.');
}
backTracking(n,cheesBoard,0);
return res;
}
private void backTracking(int n,char[][] cheesBoard,int row){
if(row == n){
res.add(arraysToList(cheesBoard));
}
for(int col = 0;col < n;col++){
if(!isValid(cheesBoard,row,col,n)){
continue;
}
cheesBoard[row][col] = 'Q';
backTracking(n,cheesBoard,row+1);
cheesBoard[row][col] = '.';
}
}
private List<String> arraysToList(char[][] cheesBoard){
List<String> list = new ArrayList<>();
for(char[] chars:cheesBoard){
list.add(String.copyValueOf(chars));
}
return list;
}
private boolean isValid(char[][] cheesBoard,int row,int col,int n){
//检查列方向
for(int i = 0; i < row;i++){
if(cheesBoard[i][col] == 'Q'){
return false;
}
}
//检查左上
for (int i=row-1, j=col-1; i>=0 && j>=0; i--, j--){
if(cheesBoard[i][j] == 'Q'){
return false;
}
}
//检查右上
for(int i = row-1,j = col+1;i >=0&&j<n;i--,j++){
if(cheesBoard[i][j] == 'Q'){
return false;
}
}
return true;
}
}