51 52.N-Queens I II

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.

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-Queens II

 

Follow up for N-Queens problem.

Now, instead outputting board configurations, return the total number of distinct solutions.

分析及例程摘自《算法竞赛入门经典》

boolean[][] vis;
	List<List<String>> retlist=new ArrayList<>();
	
	public List<List<String>> solveNQueens(int n)
	{
		vis=new boolean[3][2*n];
		int[] c=new int[n];
		dfs(0, n, c);
		
		return retlist;
	}
	
	public void dfs(int cur,int n,int[] c)
	{
		if(cur==n)
		{
			char[][] carr=new char[n][n];
			ArrayList<String> arraylist=new ArrayList<>();
			for(int i=0;i<n;i++)
			{
				Arrays.fill(carr[i], '.');
				carr[i][c[i]]='Q';
				arraylist.add(new String(carr[i]));
			}
			retlist.add(arraylist);
			return ;
		}
			
		for(int i=0;i<n;i++)
		{
			if(!vis[0][i]&&!vis[1][cur+i]&&!vis[2][cur-i+n])
			{
				c[cur]=i;
				vis[0][i]=vis[1][cur+i]=vis[2][cur-i+n]=true;   //如上图主对角线标识cur-i可能<0，整体向右平移n
				dfs(cur+1, n, c);
				vis[0][i]=vis[1][cur+i]=vis[2][cur-i+n]=false;
			}
		}
	}

------------------------------------------------------------------------------------------------------------------------

public class Solution {
   boolean[][] vis;
	int cnt=0;
	
	public int totalNQueens(int n)
	{
		vis=new boolean[3][2*n];
		dfs(0, n);
		
		return cnt;
	}
	
	public void dfs(int cur,int n)
	{
		if(cur==n)
		{
			cnt++;
			return ;
		}
			
		for(int i=0;i<n;i++)
		{
			if(!vis[0][i]&&!vis[1][cur+i]&&!vis[2][cur-i+n])
			{
				vis[0][i]=vis[1][cur+i]=vis[2][cur-i+n]=true;
				dfs(cur+1, n);
				vis[0][i]=vis[1][cur+i]=vis[2][cur-i+n]=false;
			}
		}
	}
}