源代码如下:具体解释回头再写,下周二还有面试,还是先看书去
#include<iostream>
using namespace std;
int count = 0;
void print(const int* arr , int len)
{
for (int i=0;i<len;i++)
{
cout<<arr[i];
if (i<len-1)
{
cout<<",";
}
else if (i==len-1)
{
cout<<endl;
}
}
}
void swap(int* p1,int* p2)
{
int temp = *p1;
*p1 = *p2;
*p2 = temp;
}
void recall(int* arr,int len,int index)
{
if (index<=0)
{
print(arr,len);
count++;
return;
}
for (int i=index;i>=0;i--)
{
swap(&arr[index],&arr[i]);
recall(arr,len,index-1);
swap(&arr[index],&arr[i]);
}
}
int main()
{
int N;
cin>>N;
int (*arr) = new int[N];
for (int i=0;i<N;i++)
{
arr[i] = i+1;
}
recall(arr,N,N-1);
cout<<"全排列个数为:"<<count<<endl;
}
运行结果;
3
1,2,3
2,1,3
1,3,2
3,1,2
3,2,1
2,3,1
全排列个数为:6