全排列

题目网址

#include <stdio.h>
#include<iostream>
#include <string.h>
#include <string>
#include <algorithm>
#include <map>
using namespace std;
const int maxn = 11;
int n;
int p[maxn];
int hashtable[maxn] = { false };
void DFS(int index)
{
	if (index == n + 1)
	{
		for (int i = 1; i <= n; i++)
		{
			if (i != n)
				printf("%d ", p[i]);
			else
				printf("%d\n", p[i]);
		}
		return;
	}
	for (int i = 1; i <= n; i++)
	{
		if (hashtable[i] == false)
		{
			p[index] = i;
			hashtable[i] = true;
			DFS(index + 1);
			hashtable[i] = false;
		}
	}

}
int main()
{
	scanf("%d", &n);
	DFS(1);
	return 0;
}