ASCII码排序
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 102479 Accepted Submission(s): 42870
qwe asd zxc
e q w a d s c x z
第一种做法
#include<stdio.h>
int main(){
char a,b,c,t;
while(scanf("%c%c%c",&a,&b,&c)!=EOF)
{
getchar(); //此处是为了抵掉一个回车键
if(a>b)
{
t=a;
a=b;
b=t;
} /*()内谁跟谁比大小要注意*/
if(a>c)
{
t=a;
a=c;
c=t;
}
if(b>c)
{
t=b;
b=c;
c=t;
}
printf("%c %c %c\n",a,b,c);
}
return 0;
}
第二种做法
#include <stdio.h>
void main()
{
char a[3]={'a','b','c'},temp;
int i=0,j;
while(scanf("%c%c%c",&a[0],&a[1],&a[2])!=EOF)
{
for(i=0;i<=2;i++)
{
for(j=i+1;j<=2;j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
printf("%c %c %c\n",a[0],a[1],a[2]);
getchar();
}
}