核心
void dfs(int step)
{
判断边界
尝试每一种可能for(i = 0; i < n; i++)
{
继续下一步dfs(step+1)
}
返回
}
#include <stdio.h>
#include <stdlib.h>
int a[10], book[10], n, sum;
void dfs(int step)
{
int i;
if(step == n+1)
{
for(i = 1; i <= n; i++)
printf("%d", a[i]);
sum++;
printf("\n");
return;
}
for(i = 1; i <= n; i++)
{
if(book[i] == 0)
{
a[step] = i;
book[i] = 1;
dfs(step+1);
book[i] = 0;
}
}
return;
}
int main ()
{
scanf("%d", &n);
dfs(1);
printf("%d\n",sum);
system("pause");
return 0;
}