Nqueen1.0

最新推荐文章于 2024-06-21 15:52:27 发布

原创最新推荐文章于 2024-06-21 15:52:27 发布 · 402 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Nqueen

C++ 专栏收录该内容

21 篇文章

订阅专栏

Nqueen.h

#include<vector>
using namespace std;
extern int solutionNum;
void solveNqueen(int row,vector<int> &v,int N);
bool checkPosition(int row,int col,vector<int> &v);
void printSolution(vector<int> &v);

Nqueen.cpp

#include"Nqueen.h"
#include<iostream>
#include<vector>
using namespace std;

void solveNqueen(int row,vector<int> &v,int N){
    for(int col=0;col<N;col++){
        if(checkPosition(row,col,v)){
            v[row]=col;
            if(row==N-1){
                ++solutionNum;
                //printSolution(v);
                return;
            }
            solveNqueen(row+1,v,N);
        }
    }

}

bool checkPosition(int row,int col,vector<int> &v){
    for(int x=0;x<row;++x){
        if(abs(row-x)==abs(col-v[x])||col==v[x])
            return 0;
    }
    return 1;
}

void printSolution(vector<int> &v){
    cout<<solutionNum<<":::"<<endl;
    for(auto p:v)
        cout<<p<<'\t';
    cout<<endl;
}

main.cpp

#include"Nqueen.h"
#include<iostream>
#include<vector>
using namespace std;

int solutionNum=0;

int main(){
    int N;
    cout<<"please input the value of N:"<<endl;
    cin>>N;
    vector<int> v(N);
    solveNqueen(0,v,N);
    cout<<"The total solition number is::"<<solutionNum<<endl;
    return 0;
}