n皇后问题的非递归迭代算法(C++实现)

//n皇后问题的非递归迭代算法
 
#include <iostream>
#include <cmath>


using namespace std;


class NQueen
{
private:
int numOfQueen; //the number of queens
int numOfanswer; //the number of answers
int *queen;


public:
NQueen();
NQueen(int m);
~NQueen();
bool place(int k);
void backtrack();
void showQueen();
};


NQueen::NQueen()
{
numOfQueen = 0;