<pre class="cpp" name="code">深度优先搜索
#include<iostream>
#include <cstring>
#include <cstdio>
#include<algorithm>
using namespace std;
const int n=4;
int a[n]={0};
int book[n]={0};
void dfs(int step)
{
if(step==n+1)
{
for(int i=1;i<=n;i++)
printf("%d",a[i]);
return ;
}
for(int i=1;i<=n;i++)
{
if(book[i]==0)
{
a[step]=i;
book[i]=1;
dfs(step+1);
book[i]=0;
}
}
}
int main()
{
dfs(1);
return 0;
}