java 52. N-Queens II.java

Posted 2021-05-08

public class Solution {
    public int totalNQueens(int n) {
        int[] res = {0}; // basic type will be passed by value
        boolean[] positions = new boolean[n]; // columns   |
        boolean[] d1 = new boolean[2 * n];// diagonals \
        boolean[] d2 = new boolean[2 * n];// diagonals /
        backtracking(res, 0, positions, d1, d2, n);
        return res[0];
        
    }
    
    private void backtracking(int[] res, int row, boolean[] positions, boolean[] d1, boolean[] d2, int n) {
        if(row == n) res[0]++;
        
        for(int curCol = 0; curCol < n; curCol++) {
            int diff = curCol - row + n;
            int sum = curCol + row;
            
            if(positions[curCol] || d1[diff] || d2[sum]) continue;
            
            positions[curCol] = true;
            d1[diff] = true;
            d2[sum] = true;
            backtracking(res, row + 1, positions, d1, d2, n);
            positions[curCol] = false;
            d1[diff] = false;
            d2[sum] = false;
        
        }
    }
}