【LeetCode】#51N皇后(N-Queens)

【LeetCode】#51N皇后(N-Queens)

题目描述

n 皇后问题研究的是如何将 n 个皇后放置在 n×n 的棋盘上，并且使皇后彼此之间不能相互攻击。
给定一个整数 n，返回所有不同的 n 皇后问题的解决方案。
每一种解法包含一个明确的 n 皇后问题的棋子放置方案，该方案中 ‘Q’ 和 ‘.’ 分别代表了皇后和空位。

示例

输入: 4
输出: [
[".Q…", // 解法 1
“…Q”,
“Q…”,
“…Q.”],

["…Q.", // 解法 2
“Q…”,
“…Q”,
“.Q…”]
]
解释: 4 皇后问题存在两个不同的解法。

Description

The n-queens puzzle is the problem of placing n queens on an n×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.

Example

Input: 4
Output: [
[".Q…", // Solution 1
“…Q”,
“Q…”,
“…Q.”],

["…Q.", // Solution 2
“Q…”,
“…Q”,
“.Q…”]
]
Explanation: There exist two distinct solutions to the 4-queens puzzle as shown above.

解法

class Solution{
	public List<List<String>> solveNQueens(int n){
		List<List<String>> res = new ArrayList<>();
		if(n<=0)
			return res;
		helper(n, 0, new ArrayList<Integer>(), res);
		return res;
	}
	private void helper(int n, int x, List<Integer> state, List<List<String>> res){
		if(n==x)
			generateSolution(state, n, res);
			return ;
		}
		for(int i=0; i<n; i++){
			if(valid(x, i, state){
				state.add(i);
				helper(n, x+1, state, res);
				state.remove(state.size()-1);
			}
		}
	}
	private boolean valid(int x, int y, List<Integer> state){
		for(int i=0; i<state.size(); i++){
			if(y==state.get(i)){
				return false;
			}
			if(Math.abs(y-state.get(i))==Math.abs(x-i)){
				return false;
			}
		}
		return true;
	}
	private void generateSolution(List<Integer> state, int n, List<List<String>> res){
		List<String> solution = new ArrayList<>();
		for(Integer x : state){
			StringBuilder sb = new StringBuilder();
			for(int i=0; i<x; i++){
				sb.append(".");
			}
			sb.append("Q");
			for(int i=x+1; i<n; i++){
				sb.append(".");
			}
			solution.add(sb.toString());
		}
		res.add(solution);
	}
}