扑克牌排序
...
#include <iostream>
using namespace std;
void sort(int* a, int n)
{
int i = 0;
for (i=0; i<n; ++i)
{
if (a[i] <= 2)
{
a[i] += 13;
}
}
for (i=0; i<n-1; ++i)
{
for (int j=i+1; j<n; ++j)
{
if (a[i] < a[j])
{
int temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
for (i=0; i<n; ++i)
{
if (a[i] > 13)
{
a[i] -= 13;
}
}
}
void print(int* a, int n)
{
for (int i=0; i<n; ++i)
{
if (a[i] >= 2 && a[i] <= 10)
{
cout<<a[i];
}
else if (a[i] == 1)
{
cout<<'A';
}
else if (a[i] == 11)
{
cout<<'J';
}
else if (a[i] == 12)
{
cout<<'Q';
}
else if (a[i] == 13)
{
cout<<'K';
}
cout<<" ";
}
}
int main()
{
int a[54];
int n = 0;
while (1)
{
cin>>a[n++];
char c;
cin.get(c);
if (c == '\n')
{
break;
}
}
sort(a, n);
print(a, n);
return 0;
}
8768
