满意答案
ksqpg
2014.12.11
采纳率:46% 等级:9
已帮助:316人
总得思想还是冒泡排序,改良一下就可以了。123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687#include#include#include int main(void){ char a[300]; char temp; int len; int loop, loop1; int flag; gets(a); len = (int)strlen(a); /* 冒泡排序算法 */ for(loop = 0; loop = 'a' && a[loop] <= 'z') //小写字母 { flag = 1; } else if(a[loop] >= 'A' && a[loop] <= 'Z') //大写字母 { flag = 2; } else if(a[loop] >= '0' && a[loop] <= '9') //数字 { flag = 3; } else //啥也不是 { continue; } for(loop1 = loop + 1; loop1 = 'a' && a[loop1] <= 'z') { if(a[loop] > a[loop1]) { temp = a[loop]; a[loop] = a[loop1]; a[loop1] = temp; } } else { continue; } } else if(flag == 2) { if(a[loop1] >= 'A' && a[loop1] <= 'Z') { if(a[loop] > a[loop1]) { temp = a[loop]; a[loop] = a[loop1]; a[loop1] = temp; } } else { continue; } } else { if(a[loop1] >= '0' && a[loop1] <= '9') { if(a[loop] > a[loop1]) { temp = a[loop]; a[loop] = a[loop1]; a[loop1] = temp; } } else { continue; } } } } printf("%s\n", a); return 0;}
02分享举报