LeetCode 51. N-Queens

class Solution {
    public List<List<String>> solveNQueens(int n) {
        char[][] chess = new char[n][n];
        for(int i = 0; i < n; i++){
            for(int j = 0; j < n; j++){
                chess[i][j] = '.';
            }
        }
        List<List<String>> res = new ArrayList<>();
        backtrack(chess, 0, res);
        return res;
    }
    private void backtrack(char[][] chess, int row, List<List<String>> res){
        // Base Case
        if(row == chess.length){
            res.add(construct(chess));
            return;
        }
        for(int col = 0; col < chess[0].length; col++){
            if(!isValid(chess, row, col)){
                continue;
            }
            chess[row][col] = 'Q';
            backtrack(chess, row + 1, res);
            chess[row][col] = '.';
        }
    }
    private boolean isValid(char[][] chess, int row, int col){
        // Check the same column
        for(int i = 0; i < row; i++){
            if(chess[i][col] == 'Q'){
                return false;
            }
        }
        // Check 45 degree
        for(int i = row - 1, j = col + 1; i >= 0 && j < chess.length; i--, j++){
            if(chess[i][j] == 'Q'){
                return false;
            }
        }
        // Check 135 degree
        for(int i = row - 1, j = col - 1; i >= 0 && j >= 0; i--, j--){
            if(chess[i][j] == 'Q'){
                return false;
            }
        }
        return true;
    }
    private List<String> construct(char[][] chess){
        List<String> path = new ArrayList<>();
        for(int i = 0; i < chess.length; i++){
            path.add(new String(chess[i]));
        }
        return path;
    }
}