52. N 皇后 II

void1024

于 2024-07-20 00:15:14 发布

阅读量171

点赞数 2

分类专栏：面试经典 150 题文章标签：算法深度优先数据结构

本文链接：https://blog.csdn.net/diOSyu/article/details/140562134

版权

面试经典 150 题专栏收录该内容

129 篇文章 1 订阅

订阅专栏

class Solution {
    int result = 0;
    int[] queens;
    Set<Integer> columns = new HashSet<>();
    Set<Integer> diaArr1 = new HashSet<>(); // 正对角线
    Set<Integer> diaArr2 = new HashSet<>(); // 反对角线

    public int totalNQueens(int n) {
        queens = new int[n];
        Arrays.fill(queens, -1);
        dfs(n, 0);
        return result;
    }

    private void dfs(int n, int row) {
        if (row == n) {
            result += 1;
            return;
        }
        for (int col = 0; col < n; col++) {
            if (columns.contains(col)) {
                continue;
            }
            int dia1 = row - col;
            if (diaArr1.contains(dia1)) {
                continue;
            }
            int dia2 = row + col;
            if (diaArr2.contains(dia2)) {
                continue;
            }
            queens[row] = col;
            columns.add(col);
            diaArr1.add(dia1);
            diaArr2.add(dia2);
            dfs(n, row + 1);
//            queens[row] = -1;
            columns.remove(col);
            diaArr1.remove(dia1);
            diaArr2.remove(dia2);
        }
    }

}