51. N-Queens

最新推荐文章于 2020-09-03 08:53:08 发布

myfwjy

最新推荐文章于 2020-09-03 08:53:08 发布

阅读量324

点赞数

分类专栏： LeetCode 文章标签： LeetCode

本文链接：https://blog.csdn.net/myfwjy/article/details/52367270

版权

LeetCode 专栏收录该内容

91 篇文章 0 订阅

订阅专栏

The n-queens puzzle is the problem of placing n queens on ann×n chessboard such that no two queens attack each other.

Given an integer n, return all distinct solutions to the n-queens puzzle.

Each solution contains a distinct board configuration of the n-queens' placement, where'Q' and '.' both indicate a queen and an empty space respectively.

For example,
There exist two distinct solutions to the 4-queens puzzle:

[
 [".Q..",  // Solution 1
  "...Q",
  "Q...",
  "..Q."],

 ["..Q.",  // Solution 2
  "Q...",
  "...Q",
  ".Q.."]
]

思路：

设置一个数组用来存储n个皇后所在的列数，每存放一个皇后检查一下列是否重复，对角线是否重复。

	static int[] col;
     static List<List<String>> res;

        public static List<List<String>> solveNQueens(int n) {
		res = new ArrayList<List<String>>();
		col = new int[n];
		nqueens(0, n);
		return res;
	}

	public static void nqueens(int colIndex, int n) {
		if (colIndex == n) {
			printRes(n);
			return;
		}
		for (int i = 0; i < n; i++) {
			col[colIndex] = i;
			if (valid(colIndex)) {
				nqueens(colIndex + 1, n);
			}
		}
	}

	private static boolean valid(int colIndex) {
		for (int i = 0; i < colIndex; i++) {
			// 行不可能重复，列如果重复或者对角线重复
			if (col[i] == col[colIndex]
					|| Math.abs(col[i] - col[colIndex]) == colIndex - i) {
				return false;
			}
		}
		return true;
	}

	private static void printRes(int n) {
		List<String> resList = new ArrayList<String>();
		for (int i = 0; i < n; i++) {
			StringBuffer buffer = new StringBuffer();
			int tmp = col[i];
			for (int j = 0; j < tmp; j++) {
				buffer.append(".");
			}
			buffer.append("Q");
			for (int j = tmp + 1; j < n; j++) {
				buffer.append(".");
			}
			resList.add(buffer.toString());
		}
		res.add(resList);
	}