生成排列和组合的递归实现
void perm(int a[],int num,int index)
{
if(num-1==index)
{
for(int i=0;i<num;i++)
cout<<a[i]<<",";
cout<<endl;
}
for(int j=index;j<num;j++)
{
bool flag = false;
//防止有重复的元素出现
for(int f=index;f<j;f++)
{
if(a[j]==a[f])
{
flag = true;
break;
}
}
if(flag)
continue;
int temp = a[index];
a[index] = a[j];
a[j] = temp;
perm(a,num,index+1);
a[j] = a[index];
a[index] = temp;
}
}
int combine(int a[],int n,int m,int res[],int len)
{
if(m==0)
{
for(int i=0;i<len;i++)
cout<<res[i]<<",";
cout<<endl;
return 0;
}
for(int i=n-1;i>=m-1;i--)
{
bool flag = false;
for(int j=n-1;j>i;j--)
{
if(a[j]==a[i])
flag = true;
}
if(flag)
continue;
res[m-1] = a[i];
combine(a,i,m-1,res,len);
}
}