2021-1-25 八皇后问题(DFS解法）(递归)

一.例题：
The goal of 8 Queens Problem is to put eight queens on a chess-board such that none of them threatens any of others. A queen threatens the squares in the same row, in the same column, or on the same diagonals as shown in the following figure.

For a given chess board where $k$ queens are already placed, find the solution of the 8 queens problem.

Input
In the first line, an integer $k$ is given. In the following $k$ lines, each square where a queen is already placed is given by two integers $r$ and $c$. $r$ and $c$ respectively denotes the row number and the column number. The row/column numbers start with 0.

Output
Print a $8\times 8$ chess board by strings where a square with a queen is represented by ‘Q’ and an empty square is represented by ‘.’.

Constraints
There is exactly one solution
Sample Input 1
2
2 2
5 3
Sample Output 1
…Q.
Q…
…Q…
…Q
…Q…
…Q…
.Q…
…Q…
二.解法思路：
1.二维数组表示棋盘，使用bool类型标记皇后位置，判断函数check（）的返回类型为false则表示已被皇后占领位置，下一个皇后不能再放置在这里。
2.向量和pair结构体记录先前的前置条件，即输入部分，后用来记录皇后的位置 first-x,second-y。
3.利用递归的思想推进到下一行，直到8行结束。DFS核心。

三.核心代码：
1.判断函数check（）的实现。

bool check(int row, int col)//形参为行和列的位置
{
   
    for (int i = 0; i < 8; i++)
    {