解题思路:
注意事项:
参考代码:
#include<iostream>
#include<iterator>
#include<stdio.h>
#include<iomanip>
#include<string>
#include<cstring>
#include<string.h>
#include<vector>
#include<algorithm>
#include<stdio.h>
#include<math.h>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<sstream>
using namespace std;
class card
{
public:int a; int b;
char c; char d;
void fun()
{
if (c <= '9'&&c >= '2')
a = c - '0';
else if (c == '1')
a = 10;
else if (c == 'J')
a = 11;
else if (c == 'Q')
a = 12;
else if (c == 'K')
a = 13;
else if (c == 'A')
a = 14;
if (d == 'd')
b = 0;
else if (d == 'c')
b = 1;
else if (d == 'h')
b = 2;
else if (d == 's')
b = 3;
}
void print()
{
if (c == '1')
cout << c << '0' << d;
else cout << c << d;
}
};
bool compare(card a, card b)
{
if (a.a < b.a)
return true;
else if (a.a == b.a)
{
if (a.b < b.b)
return true;
else return false;
}
else return false;
}
int main()
{
string s;
cin >> s;
card card[5];
int flag =0;
for (int i = 0; i <s.length(); i += 2)
{
if (s[i] == '1')
{
card[flag].c = s[i];
i++;
card[flag].d = s[i + 1];
card[flag].fun();
}
else
{
card[flag].c = s[i];
card[flag].d = s[i + 1];
card[flag].fun();
}
flag++;
}
sort(card, card + 5, compare);
for (int i = 0; i < 5; i++)
{
card[i].print();
cout << " ";
}
return 0;
}
0.0分
0 人评分
C语言程序设计教程(第三版)课后习题1.5 (C语言代码)浏览:620 |
简单的a+b (C语言代码)浏览:632 |
DNA (C语言描述,数据结构)浏览:862 |
【求[X,Y]内被除3余1并且被除5余3的整数的和】 (C语言代码)浏览:675 |
字符逆序 (C语言代码)浏览:460 |
C语言程序设计教程(第三版)课后习题5.5 (C语言代码)浏览:559 |
C语言程序设计教程(第三版)课后习题10.5 (C语言代码)浏览:546 |
矩阵的对角线之和 (C语言代码)浏览:1357 |
盐水的故事 (C语言代码)浏览:1529 |
小O的图案 (C语言代码)浏览:915 |