华为 2016 3套 校招

 1 链接：https://www.nowcoder.com/questionTerminal/0a92c75f5d6b4db28fcfa3e65e5c9b3f
 2 来源：牛客网
 3 
 4 //“输入每手牌可能是个子，对子，顺子（连续5张），三个，炸弹（四个）和对王中的一种，
 5 //不存在其他情况，由输入保证两手牌都是合法的，顺子已经从小到大排列“
 6 //这句规则让牌面类型的确定和大小的比较直接可以转换为牌个数的比较了，这是解决测试问题的捷径！
 7 //所以一定要善于利用题目已知条件！！！
 8 #include <iostream>
 9 #include <string>
10 #include <algorithm>
11 using namespace std;
12 int main(){
13     string line;
14     while(getline(cin,line)){
15         if(line.find("joker JOKER")!=-1)
16             cout<<"joker JOKER"<<endl;
17         else{
18             int dash=line.find(‘-‘);
19             string car1=line.substr(0,dash);
20             string car2=line.substr(dash+1);
21             int c1=count(car1.begin(),car1.end(),‘ ‘);
22             int c2=count(car2.begin(),car2.end(),‘ ‘);
23             string first1=car1.substr(0,car1.find(‘ ‘));
24             string first2=car2.substr(0,car2.find(‘ ‘));
25             string str="345678910JQKA2jokerJOKER";
26             if(c1==c2){
27                 if(str.find(first1)>str.find(first2))
28                     cout<<car1<<endl;
29                 else
30                     cout<<car2<<endl;
31             }else
32                 if(c1==3)
33                     cout<<car1<<endl;
34                 else if(c2==3)
35                     cout<<car2<<endl;
36                 else
37                     cout<<"ERROR"<<endl;
38         }
39     }
40 }

 1 #include<iostream>
 2 #include<string>
 3 #include<vector>
 4 #include<algorithm>
 5 using namespace std;
 6 
 7 bool compare(pair<string,int> a,pair<string,int> b)
 8 {
 9     return a.second > b.second;
10 }
11 int main()
12 {
13     string input, str;
14     vector<pair<string, int>> error;
15     while (getline(cin, input))
16     {
17         if (input.size()==0) break;
18         int pos = input.rfind(‘\\‘);
19         str = input.substr(pos + 1);
20         error.push_back(make_pair(str,1));
21         for (int i = 0; i < (error.size() - 1);i++)
22         {
23             if (error[i].first == str)
24             {
25                 error[i].second++;
26                 error.pop_back();
27                 break;
28             }
29         }
30 
31     }
32 
33     stable_sort(error.begin(),error.end(),compare);
34 
35     int idx = 0;
36     while (idx < 8 && idx<error.size())
37     {
38         string check = error[idx].first;
39         int t = check.find(‘ ‘);
40         if (t>16)
41             error[idx].first.erase(0,t-16);
42         //或者 error[idx].first=error[idx].first.substr(t - 16);
43         cout << error[idx].first << " " << error[idx].second << endl;
44         idx++;
45 
46     }
47 
48     return 0;
49 }