public class Solution { public List<List<String>> solveNQueens(int n) { List<List<String>> result = new ArrayList<>(); char[][] board = new char[n][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { board[i][j] = '.'; } } backtrack(result, board, 0); return result; }
private boolean isValid(char[][] board, int row, int col) { // Check the column for (int i = 0; i < row; i++) { if (board[i][col] == 'Q') { return false; } } // Check the main diagonal int i = row - 1, j = col - 1; while (i >= 0 && j >= 0) { if (board[i--][j--] == 'Q') { return false; } } // Check the other diagonal i = row - 1; j = col + 1; while (i >= 0 && j < board.length) { if (board[i--][j++] == 'Q') { return false; } } return true; } } jav g-queen
The time complexity of the solution is O(N!), where N is the number of queens. This is because in the worst case, we need to try all possible configurations of the board. The solution uses a backtracking approach to place
The isValid method checks if a queen can be placed at a given position on the board by checking the column and diagonals. This is because we need to store the
The solution uses a backtracking approach to place queens on the board. The solveNQueens method initializes the board and calls the backtrack method to start the backtracking process.
The space complexity of the solution is O(N^2), where N is the number of queens. This is because we need to store the board configuration and the result list.