DFS实现输出排列A(9,9)的所有结果:
#include <iostream>
using namespace std;
bool in_use[9] = {false};
int num_set[9] = {0};
int count = 0;
void dfs(int length)
{
if (length == 9)
{
for (int i = 0; i < 9; ++i)
{
cout << num_set[i] << " ";
}
cout << endl;
++count;
return;
}
for (int i = 1; i <= 9; ++i)
{
if (in_use[i - 1] == false)
{
in_use[i - 1] = true;
num_set[length] = i;
dfs(length + 1);
in_use[i - 1] = false;
}
}
}
int main()
{
dfs(0);
cout << count << endl;
return 0;
}