Jav G-queen 【Certified】

The N-Queens problem is a classic backtracking problem in computer science, where the goal is to place N queens on an NxN chessboard such that no two queens attack each other.

Given an integer n , return all possible configurations of the board where n queens can be placed without attacking each other. jav g-queen

The isValid method checks if a queen can be placed at a given position on the board by checking the column and diagonals. The N-Queens problem is a classic backtracking problem

The backtrack method checks if the current row is the last row, and if so, adds the current board configuration to the result list. Otherwise, it tries to place a queen in each column of the current row and recursively calls itself. The backtrack method checks if the current row

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; }