N皇后 - Java

回溯+递归

class Solution {

    int res = 0;

    public int totalNQueens(int n) {
        int[][] board = new int[n][n];

        backtrack(board, 0);
        return res;
    }

    public void backtrack(int[][] board, int row) {

        int n = board.length;

        if (row == n) {
            res++;
            return;
        }

        for (int column = 0; column < n; column++) {
            if (!isSafe(board, row, column)) {
                continue;
            }
            board[row][column] = 1;
            backtrack(board, row + 1);
            board[row][column] = 0;
        }
    }

    public boolean isSafe(int[][] board, int row, int column) {

        // 判断此列是否有皇后
        for (int i = 0; i < row; i++) {
            if (board[i][column] == 1) {
                return false;
            }
        }

        // 判断左上对角线是否有皇后
        for (int i = row - 1, j = column - 1; i >= 0 && j >= 0; i--, j--) {
            if (board[i][j] == 1) {
                return false;
            }
        }

        // 判断右上对角线是否有皇后
        for (int i = row - 1, j = column + 1; i >= 0 && j < board.length; i--, j++) {
            if (board[i][j] == 1) {
                return false;
            }
        }

        return true;
    }
}