迷宫（栈、队列、递归3种方法）和八皇后（栈和递归2种方法）的C/C++描述（下）

八皇后问题，要求皇后们不能在同一行同一列，以及类似于对角线上。可以用一个一维数组来存储皇后们的行列坐标。一维数组，一个下标对应一个元素，相当于一行只放一个皇后。然后再验证满足另外两个条件就可以了。因为不允许定义动态数组，所以，作为结构体的一部分，还需要一个成员记录数组的实际存放的皇后数量，始终指向最后一个皇后，这就是栈的应用。无论是用栈的方法结合for循环，还是递归方法，都离不开栈。递归的特殊之处是，从第一行往大数方向递归。通常的递归，如斐波那契数列都是下标从大往小递归。这是理解的难点之处。代码里变量名很详细，见名知意。就不再补充了。
1 栈 ：

#include<iostream>
using namespace std;
#define MAXSIZE 100
#include<cmath>

struct SequenStack {
	int indexRank;
	int colomn[MAXSIZE];
};

void dispalySort(SequenStack &sequenStack) {
	static int countSort = 0;
	countSort++;
	cout << "sort " << countSort << " : ";

	for (int rank = 1; rank <= sequenStack.indexRank; rank++)
		cout << '(' << rank << ',' << sequenStack.colomn[rank] << ')' << "  ";
	cout << endl;

	for (int i = 1; i <= sequenStack.indexRank; i++) {
		for (int colo = 1; colo <= sequenStack.indexRank; colo++)
			if (colo != sequenStack.colomn[i])
				cout << "0 ";
			else
				cout << "1 ";
		cout << endl;
	}
	cout << endl;
}



bool checkPlace(SequenStack &sequenStack, int rank, int colomn) {
	bool result = true;
	if (1 == rank)
		return true;
	int i;
	for (i = 1; i <= rank - 1; i++)
		if (sequenStack.colomn[i] == colomn ||
			abs(rank - i) == abs(colomn - sequenStack.colomn[i])) {
			result = false;
			break;
		}
	return result;
}


void queen(int numbOfQueen) {
	SequenStack sequenStack;
	sequenStack.indexRank = 1;
	sequenStack.colomn[sequenStack.indexRank] = 0;
	 
	int rank,colomn;
	bool find = false;
	while (sequenStack.indexRank != 0) {
		rank = sequenStack.indexRank;
		find = false;
		for (colomn = sequenStack.colomn[rank] + 1; colomn <= numbOfQueen; colomn++)
			if (checkPlace(sequenStack, rank, colomn)) {
				sequenStack.colomn[rank] = colomn;
				find = true;
				break;
			}
		if (find && rank == numbOfQueen)
			dispalySort(sequenStack);
		else if (find) {
			sequenStack.indexRank++;
			sequenStack.colomn[sequenStack.indexRank] = 0;
		}
		else
			sequenStack.indexRank--;
	}
}
int main() {
	int numbOfQueen;
	cout << "input the number of queens : ";
	cin >> numbOfQueen;

	queen(numbOfQueen);
	return 0;

}

测试结果如下：

2 递归

#include<iostream>
using namespace std;
#define MAXSIZE 10
#include<cmath>

void dispalySort(int numbOfQueen,int colomn[]) {
	cout << "the " << colomn[numbOfQueen] << "th array : " << endl;
	for (int rank = 0; rank < numbOfQueen; rank++) {
		for (int col = 0; col < numbOfQueen; col++)
			if (col == colomn[rank])
				cout << "1 ";
			else
				cout << "0 ";
		cout << endl;
	}
	cout << endl;
}

bool checkPlace(int rank,int colomn[]) {
	bool result = true;
	if (rank == 0)
		return true;
	else
		for (int i = 0; i < rank; i++) 
			if (colomn[i] == colomn[rank] ||
				abs(i - rank) == abs(colomn[i] - colomn[rank])) {
				result = false;
				break;
			}
	return result;
}

void queen(int rank,int numbOfQueen,int colomn[]) {
	if (rank == numbOfQueen) {  // 可以在colomn[number]里保存排列个数
		colomn[numbOfQueen] += 1;
		dispalySort(numbOfQueen,colomn);
		return;
	}
	
	for (colomn[rank] = 0; colomn[rank] < numbOfQueen; colomn[rank] += 1)
		if (checkPlace(rank, colomn))
			queen(rank + 1, numbOfQueen, colomn);
}

int main() {
	int numbOfQueen;
	int colomn[MAXSIZE];
	cout << "input the number of queens : ";
	cin >> numbOfQueen;

	colomn[numbOfQueen] = 0;
	queen(0,numbOfQueen,colomn);

	return 0;

}

测试结果如下：