leetcode第51题,N皇后。解决的核心思路是递归+回溯,与解数独那个思路类似。
class Solution {
public List<List<String>> solveNQueens(int n) {
List<List<String>> list = new ArrayList<>();
char [][]cs = new char[n][n];
for(int i = 0;i < n;i++){
for(int j = 0;j < n;j++){
cs[i][j] = '.';
}
}
putQueen(list, 0, n, cs);
return list;
}
// 尝试放置:递归+回溯
private void putQueen(List<List<String>> list, int row, int n,char [][]cs) {
if (row == n) {
List<String> l = new ArrayList<String>();
for(int i = 0;i < n;i++){
l.add(new String(cs[i]));
}
list.add(l);
return;
}
for (int i = 0; i < n; i++) {
f