public int totalNQueens(int n) {
if (n == 1) return 1;
// 第i行的皇后放在那一列
int[] records = new int[n];
return process(records, n, 0);
}
private int process(int[] records, int n, int rowIdx) {
if (rowIdx == n) {
return 1;
}
int res = 0;
for (int i = 0; i < n; i++) {
if (isValid(records, rowIdx, i)) {
records[rowIdx] = i;
res += process(records, n, rowIdx+1);
}
}
return res;
}
private boolean isValid(int[] records, int x, int y) {
for (int i = 0; i < x; i++) {
if (records[i] == y || y - records[i] == x - i || y - records[i] == i - x) {
return false;
}
}
return true;
}
07-17
07-17
07-17
“相关推荐”对你有帮助么?
-
非常没帮助
-
没帮助
-
一般
-
有帮助
-
非常有帮助
提交