2020.5.24 【更】 回来啦回来啦
输入一个字母字符串,字母按照顺序递增,要求输出所有的排序(全排列)
输入用例:
abc
输出用例:
abc
acb
bac
bca
cab
cba (注意:一定要先输出cab,再cba,按照字母序。)
————————
输入用例:
abcde
输出用例:
abcde
abced
abdce
abdec
abecd
abedc
acbde
acbed
acdbe
acdeb
acebd
acedb
adbce
adbec
adcbe
adceb
adebc
adecb
aebcd
aebdc
aecbd
aecdb
aedbc
aedcb
bacde
baced
badce
badec
baecd
baedc
bcade
bcaed
bcdae
bcdea
bcead
bceda
bdace
bdaec
bdcae
bdcea
bdeac
bdeca
beacd
beadc
becad
becda
bedac
bedca
cabde
cabed
cadbe
cadeb
caebd
caedb
cbade
cbaed
cbdae
cbdea
cbead
cbeda
cdabe
cdaeb
cdbae
cdbea
cdeab
cdeba
ceabd
ceadb
cebad
cebda
cedab
cedba
dabce
dabec
dacbe
daceb
daebc
daecb
dbace
dbaec
dbcae
dbcea
dbeac
dbeca
dcabe
dcaeb
dcbae
dcbea
dceab
dceba
deabc
deacb
debac
debca
decab
decba
eabcd
eabdc
eacbd
eacdb
eadbc
eadcb
ebacd
ebadc
ebcad
ebcda
ebdac
ebdca
ecabd
ecadb
ecbad
ecbda
ecdab
ecdba
edabc
edacb
edbac
edbca
edcab
edcba
代码:(此算法可处理输入不按字母序的字符串)
#include<stdio.h>
#include<stdlib.h>
//sizeof随时可以用; 数据非常大
char a[15],temp[15];
int vis[15]={0};
int m;
int cmp( const void *a , const void *b )
{
return *(char *)a - *(char *)b;
}
int g=0;
void dfs(int s){//注意全局变量和局部变量!!!
int i;
if(a[s]=='\0'){
g++;
printf("第%d种情况",g) ;
printf("%s\n",temp);
return;
}
for(i=0;a[i];i++){//回溯
if(vis[i]==0){
vis[i]=1;
temp[s]=a[i];
dfs(s+1);
vis[i]=0;
}
}
}
int main(){
scanf("%s",a);//abcdefghijk
int i;
for(i=0;i<15;i++){
if(a[i]=='\0'){
break;
}
}
m=i;
qsort(a,m,sizeof(a[0]),cmp);
dfs(0);
printf("\n");
return 0;
}
————————————
经过一年的考研复习,终于录取了!
迟点写点考研经历吧~
回归!