wxlinlin的博客

回溯法解决N皇后问题(C++)#include<iostream>#include<math.h>#include <stdlib.h>using namespace std;int x[5];int y[5];int n = 4;int m = 0;//int k=2,j=1;//放置条件int place(int k, int j){ for (int i = 1; i <= k - 1; i++) { if (abs(x[i

回溯法解决N皇后问题(C++)#include<iostream>#include<math.h>using namespace std;int x[5];int y[5];int n=4;//int k=2,j=1;//放置条件int place(int k,int j){ for(int i=1;i<=k-1;i++) { if (abs(x[i] - k) == abs(y[i] - j) || y[i] == j) { retu