【HDOJ】 2000 ASCII码排序(三个数排序)

题目链接： http://acm.hdu.edu.cn/showproblem.php?pid=2000



/*解法一*/
#include<iostream>
using namespace std;

void main()
{
	char a,b,c,x,y,z;
	while(cin>>a>>b>>c)
	{
		x=a<b?a:b;  //x最小
		x=x<c?x:c;
		y=a>b?a:b;  //y最大
		y=y>c?y:c;
		z=a+b+c-x-y;
		cout<<x<<" "<<z<<" "<<y<<endl;
	}
}

--------------------------------------------------------------------------------------------------------------------------

/*解法二*/
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
	char a[10001];
	int x,i;
	while(cin>>a)
	{
		x=strlen(a);
		sort(a,a+x);
		for(i=0;i<x-1;i++)
			cout<<a[i]<<' ';
		cout<<a[x-1]<<endl;
	}
	
	return 0;
}

--------------------------------------------------------------------------------------------------------------------------

/*解法三*/
#include<iostream>
using namespace std;
int main()
{
    char a,b,c;
    while(cin>>a>>b>>c)
    {
        if(a>=b && a>=c && b>=c) cout<<c<<" "<<b<<" "<<a<<endl;
        else if(a>=b && a>=c && c>=b) cout<<b<<" "<<c<<" "<<a<<endl;
        else if(b>=a && b>=c && a>=c) cout<<c<<" "<<a<<" "<<b<<endl;
        else if(b>=a && b>=c && c>=a) cout<<a<<" "<<c<<" "<<b<<endl;
        else if(c>=a && c>=b && a>=b) cout<<b<<" "<<a<<" "<<c<<endl;
        else  cout<<a<<" "<<b<<" "<<c<<endl;
    }
    return 0;
}

总结：学习解法二！algorithm