N皇后(java代码).docx

下面是一个试着解决 n 皇后问题的 Java 程序实现：

```java

import java.util.ArrayList;

import java.util.List;

public class NQueens {

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++) {

}

private void backtrack(List<List<String>> result, char[][] board, int row) {

if (row == board.length) {

result.add(construct(board));

return;

}

for (int col = 0; col < board.length; col++) {

if (isValid(board, row, col)) {

board[row][col] = 'Q';

backtrack(result, board, row + 1);

// 检查同一列是否有皇后

for (int i = 0; i < row; i++) {

if (board[i][col] == 'Q') {

return false;

}

}