N-Queens N皇后问题 DFS

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皇后问题，DFS。

/*2015.8.18cyq*/
#include <iostream>
#include <vector>
#include <string>
using namespace std;

class Solution {
public:
    vector<vector<string>> solveNQueens(int n) {
		vector<string> board(n,string(n,'-'));//'-'表示未放置,'.'表示禁止放置
		vector<vector<string>> result;
		dfs(board,0,n,result);
		return result;
    }
private:
	void dfs(vector<string> &board,int row,int n,vector<vector<string>> &result){
		if(row==n){
			result.push_back(board);
			return ;
		}
		for(int col=0;col<n;col++){//遍历当前行
			if(board[row][col]=='-'){//找到可以放置的格子
				vector<string> tmp(board);//创建副本再修改局势，避免board的恢复
				for(int i=0;i<n;i++){//用该格子禁用8个方向的格子
					for(int j=0;j<n;j++){
						if(tmp[i][j]=='-'){
							if(i==row||j==col||i+j==row+col||i-j==row-col)
								tmp[i][j]='.';
						}
					}
				}
				tmp[row][col]='Q';
				dfs(tmp,row+1,n,result);//dfs下一行
			}
		}
	}
};

int main(){
	Solution solu;
	vector<vector<string> > result=solu.solveNQueens(4);
	cout<<result.size()<<endl;
	return 0;
}