递归C语言排列组合方式,请教 如何不用递归实现排列组合

该楼层疑似违规已被系统折叠 隐藏此楼查看此楼

看一下这个八皇后的回溯解法，基本原理差不多

#include 

#define OUTPUT //是否输出解

#define N 8

int count;

int queen[N], column[N], left[N*2-1], right[N*2-1];

void F()

{

&nbsp&nbsp&nbsp int i = 0, j = N;

&nbsp&nbsp&nbsp while (1)

&nbsp&nbsp&nbsp {

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp if (j == 0)

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp {

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp if (--i 

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp break;

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp j = queen[i];

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp column[j] = left[i+j] = right[N-1-j+i] = 0;

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp continue;

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp }

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp while (j > 0)

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp {

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp --j;

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp if (column[j]==0 && left[i+j]==0 && right[N-1-j+i]==0)

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp {

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp queen[i] = j;

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp column[j] = left[i+j] = right[N-1-j+i] = 1;

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp if (++i != N)

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp j = N;

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp else

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp {

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp ++count;

#ifdef OUTPUT

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp printf("%d:", count);

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp for (int m = N; m > 0; )

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp printf(" %d", queen[--m]);

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp putchar('\n');

#endif

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp --i;

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp column[j] = left[i+j] = right[N-1-j+i] = 0;

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp }

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp break;

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp &nbsp&nbsp&nbsp }

&nbsp&nbsp&nbsp &nbsp&nbsp&nbsp }

&nbsp&nbsp&nbsp }

}

int main()

{

&nbsp&nbsp&nbsp F();

&nbsp&nbsp&nbsp printf("N=%d，%d 组解\n", N, count);

&nbsp&nbsp&nbsp return 0;

}