题目54：在扑克游戏中玩家1能赢多少局？

欧拉计划

Poker hands

In the card game poker, a hand consists of five cards and are ranked, from lowest to highest, in the following way:

• High Card: Highest value card.
• One Pair: Two cards of the same value.
• Two Pairs: Two different pairs.
• Three of a Kind: Three cards of the same value.
• Straight: All cards are consecutive values.
• Flush: All cards of the same suit.
• Full House: Three of a kind and a pair.
• Four of a Kind: Four cards of the same value.
• Straight Flush: All cards are consecutive values of same suit.
• Royal Flush: Ten, Jack, Queen, King, Ace, in same suit.
  

The cards are valued in the order:
2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King, Ace.

If two players have the same ranked hands then the rank made up of the highest value wins; for example, a pair of eights beats a pair of fives (see example 1 below). But if two ranks tie, for example, both players have a pair of queens, then highest cards in each hand are compared (see example 4 below); if the highest cards tie then the next highest cards are compared, and so on.

Consider the following five hands dealt to two players:



The file, poker.txt, contains one-thousand random hands dealt to two players. Each line of the file contains ten cards (separated by a single space): the first five are Player 1's cards and the last five are Player 2's cards. You can assume that all hands are valid (no invalid characters or repeated cards), each player's hand is in no specific order, and in each hand there is a clear winner.

How many hands does Player 1 win?

题目：

在扑克游戏中，一局牌由五张牌组成，组成的牌的大小由低向高如下：

• High Card: 最高值的牌.
• One Pair: 两张面值一样的牌.
• Two Pairs: 两个值不同的One Pair.
• Three of a Kind: 三张面值一样的牌.
• Straight: 所有的牌面值为连续数值.
• Flush: 所有的牌花色相同.
• Full House: Three of a Kind 加一个One Pair.
• Four of a Kind: 四张牌面值相同.
• Straight Flush: 所有的牌花色相同并且为连续数值.
• Royal Flush: 10，J，Q，K和A，并且为相同花色。
  

牌的面值大小排序如下：
2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King, Ace.

如果两个玩家的牌具有同样的排序（上面介绍的几种），那么他们牌的大小由手中最大的牌决定。例如，一对 8 比一对 5 大（见下面例一）；但是如果两个玩家都用一对 Q，那么他们手中最大的牌就用来比较大小（见下面例四）；如果他们最高面值的牌也相等，那么就用次高面值的牌比较，以此类推。

考虑下面的几个例子：



文件 p054_poker.txt (29.3 KB, 下载次数: 35)

2015-6-12 22:55 上传

点击文件名下载附件
poker.txt

包含一千局随机牌。每一行包含十张牌（用空格分隔）；前五张是玩家 1 的牌，后五张是玩家 2 的牌。 所有的牌都是合理的（没有非法字符或者重复的牌）。每个玩家的牌没有顺序，并且每一局都有明确的输赢。

其中玩家 1 能赢多少局？

jerryxjr1220

这题不是难，是很烦，要考虑很多种情况，写不同条件.
帖子长度关系，省略牌组数据，可以自行粘贴。
376
[Finished in 0.2s]

1. pokerdata = ['8C','TS','KC','9H','4S','7D','2S','5D','3S','AC','5C','AD','5D','AC','9C','7C','5H','8D','TD','KS','3H','7H','6S','KC','JS','QH','TD','JC','2D','8S','TH','8H',
   
2. ######################
   
3. ######################
   
4. ###~~~省略牌组数据~~~###
   
5. ######################
   
6. ######################
   
7. '2D','JS','QD','AC','9C','JD','7C','6D','TC','6H','6C','JC','3D','3S','QC','KC','3S','JC','KD','2C','8D','AH','QS','TS','AS','KD','3D','JD','8H','7C','8C','5C','QD','6C']
   
8. 
   
9. def evalHand(hand):
   
10.     values = ['2','3','4','5','6','7','8','9','T','J','Q','K','A']
    
11. 
    
12.     flush = 1
    
13.     suit = hand[0][1]
    
14.     for card in hand:
    
15.         if card[1] <> suit:
    
16.             flush = 0
    
17.             break
    
18. 
    
19.     indices = []
    
20.     royal = 1
    
21.     straight = 1
    
22.     for card in hand:
    
23.         indices.append(values.index(card[0]))
    
24.     indices.sort()
    
25.     if indices[4] - indices[0] <> 4 \
    
26.        or indices.count(indices[0]) > 1 \
    
27.        or indices.count(indices[1]) > 1 \
    
28.        or indices.count(indices[2]) > 1 \
    
29.        or indices.count(indices[3]) > 1 \
    
30.        or indices.count(indices[4]) > 1:
    
31.         straight = 0
    
32.     if indices[0] <> 8:
    
33.         royal = 0
    
34. 
    
35.     kinds = []
    
36.     for value in indices:
    
37.         count = indices.count(value)
    
38.         if count > 1:
    
39.             kind = [value, count]
    
40.             if kind not in kinds:
    
41.                 kinds.append(kind)
    
42. 
    
43.     if royal and flush:
    
44. #        return "royal flush"
    
45.         return [9, 0]
    
46.     if straight and flush:
    
47. #        return "straight flush"
    
48.         return [8, indices[4]]
    
49.     if len(kinds) == 1 and kinds[0][1] == 4:
    
50. #        return "four of a kind"
    
51.         return [7, kinds[0][0]]
    
52.     if len(kinds) == 2 and (kinds[0][1] + kinds[1][1] == 5):
    
53. #        return "full house"
    
54.         return [6, kinds[0][0]]
    
55.     if flush:
    
56. #        return "flush"
    
57.         return [5, indices[4]]
    
58.     if straight:
    
59. #        return "straight"
    
60.         return [4, indices[4]]
    
61.     if len(kinds) == 1 and kinds[0][1] == 3:
    
62. #        return "three of a kind"
    
63.         return [3, kinds[0][0]]
    
64.     if len(kinds) == 2 and (kinds[0][1] + kinds[1][1] == 4):
    
65. #        return "two pair"
    
66.         return [2, max(kinds[0][0], kinds[1][0])]
    
67.     if len(kinds) == 1 and kinds[0][1] == 2:
    
68. #        return "one pair"
    
69.         return [1, kinds[0][0]]
    
70. #    return "high card"
    
71.     return [0, max(indices)]
    
72. 
    
73. rounds = []
    
74. for rd in range(1000):
    
75.     rounds.append(pokerdata[rd*10:rd*10+10])
    
76. 
    
77. count = 0
    
78. for r in rounds:
    
79.     p1 = evalHand(r[0:5])
    
80.     p2 = evalHand(r[5:10])
    
81.     if p1[0] > p2[0] or (p1[0] == p2[0] and p1[1] > p2[1]):
    
82.         count = count + 1
    
83. 
    
84. print count

复制代码

王小召

总共进行了: 1000 次比赛
P1赢了: 379 次!
P2赢了: 621 次!
用时：0.156001 秒

1. import re
   
2. import time
   
3. 
   
4. # 计算手牌属于哪种组合以及特征值
   
5. def cal_max(cards):
   
6.     color = [_ for _ in filter(None, re.split('[\dTJQKA ]', cards)[1:])]
   
7.     value = [_ for _ in filter(None, re.split('[CDHS ]', cards)[:-1])]
   
8. 
   
9.     for i in range(5):
   
10.         if value[i] == 'T':
    
11.             value[i] = 10
    
12.         elif value[i] == 'J':
    
13.             value[i] = 11
    
14.         elif value[i] == 'Q':
    
15.             value[i] = 12
    
16.         elif value[i] == 'K':
    
17.             value[i] = 13
    
18.         elif value[i] == 'A':
    
19.             value[i] = 14
    
20.         else:
    
21.             value[i] = int(value[i])
    
22.     value.sort()
    
23.     if len(set(color)) == 1:
    
24.         # # Case 9: 同花顺
    
25.         if len(set([int(value[i]) - int(value[i-1]) for i in range(1, 5)])) == 1:
    
26.             return [9, value]
    
27.         else:
    
28.             # Case 6: 同花
    
29.             return [6, value]
    
30.     else:
    
31.         single_values = []
    
32.         single_counts = []
    
33.         for each_value in set(value):
    
34.             single_values.append(each_value)
    
35.             single_counts.append(value.count(each_value))
    
36. 
    
37.         # Case 8: 炸弹
    
38.         if 4 in single_counts:
    
39.             return [8, single_values[single_counts.index(4)]]
    
40. 
    
41.         # Case 7: 三条加一对
    
42.         elif 3 in single_counts and 2 in single_counts:
    
43.             return [7, single_values[single_counts.index(3)]]
    
44. 
    
45.         # Case 4: 三条
    
46.         elif 3 in single_counts:
    
47.             return [4, single_values[single_counts.index(3)]]
    
48. 
    
49.         # Case 3: 两个对子
    
50.         elif 2 in single_counts and single_counts.count(2) == 2:
    
51.             tmp = []
    
52.             for i in range(len(single_counts)):
    
53.                 if single_counts[i] == 2:
    
54.                     tmp.append(single_values[i])
    
55.             tmp.sort()
    
56.             return [3, tmp, single_values[single_counts.index(1)]]
    
57. 
    
58.         # Case 2: 单个对子
    
59.         elif 2 in single_counts:
    
60.             max_value = single_values[single_counts.index(2)]
    
61.             single_values.remove(max_value)
    
62.             single_values.sort()
    
63.             return [2, max_value, single_values]
    
64. 
    
65.         # Case 5: 顺子
    
66.         elif len(set([int(value[i]) - int(value[i-1]) for i in range(1, 5)])) == 1:
    
67.             return [5, max(value)]
    
68. 
    
69.         # Case 1: 单牌
    
70.         else:
    
71.             return [1, value]
    
72. 
    
73. 
    
74. with open(r'C:\Users\wangyongzhao\Desktop\p054_poker.txt') as f:
    
75.     cases = f.readlines()
    
76.     total_games = len(cases)  # 总胜场计数
    
77.     count1 = 0  # p1 胜场计数
    
78.     count2 = 0  # p2 胜场计数
    
79.     for each in cases:
    
80.             p1 = cal_max(each.strip()[:14])
    
81.             p2 = cal_max(each.strip()[15:])
    
82.             if p1[0] > p2[0]:
    
83.                 count1 += 1
    
84.             elif p1[0] < p2[0]:
    
85.                 count2 += 1
    
86.             else:
    
87.                 # 都是对子或者都是顺子，从第一结果看平局了， 分情况讨论
    
88.                 # 第一种情况，都是单牌(从大到小逆序挨个作比较，有不同值就产生结果)
    
89.                 if p1[0] == 1:
    
90.                     for i in range(4, -1, -1):
    
91.                         if p1[1][i] < p2[1][i]:
    
92.                             count2 += 1
    
93.                             break
    
94.                         elif p1[1][i] > p2[1][i]:
    
95.                             count1 += 1
    
96.                             break
    
97.                 # 第二种情况，都有对子(实际9个case都要分类讨论，但是file里只涉及这两种！)
    
98.                 elif p1[0] == 2:
    
99.                     if p1[1] > p2[1]:
    
100.                         count1 += 1
     
101.                     elif p1[1] < p2[1]:
     
102.                         count2 += 1
     
103.                     else:
     
104.                         for i in range(2, -1, -1):
     
105.                             if p1[2][i] < p2[2][i]:
     
106.                                 count2 += 1
     
107.                                 break
     
108.                             elif p1[2][i] > p2[2][i]:
     
109.                                 count1 += 1
     
110.                                 break
     
111.                 else:
     
112.                     print("未分类平局对决", p1, "《--》", p2)
     
113. print("总共进行了: {} 次比赛\nP1赢了: {} 次!\nP2赢了: {} 次!\n用时：{} 秒".format(total_games, count1, count2, time.process_time()))
     

复制代码

fc1735

1. vm = {'T' : 10, 'J' : 11, 'Q' : 12, 'K' : 13, 'A' : 14}
   
2. for i in range(2, 10):
   
3.   vm[str(i)] = i
   
4. sm = {'C' : 0, 'D' : 1, 'S' : 2, 'H' : 3}
   
5. def fun(x):
   
6.   v = [0] * 15
   
7.   s = [0] * 4
   
8.   for i in x:
   
9.     v[vm[i[0]]] += 1
   
10.     s[sm[i[1]]] += 1
    
11.   r = [0] * 9
    
12.   r[8] = max(map(lambda x: x[0] if x[1] != 0 else 0, enumerate(v)))
    
13.   r[7] = max(map(lambda x: x[0] if x[1] == 2 else 0, enumerate(v)))
    
14.   r[6] = r[7] if len(list(filter(lambda x: x == 2, v))) == 2 else 0
    
15.   r[5] = max(map(lambda x: x[0] if x[1] == 3 else 0, enumerate(v)))
    
16.   tmp = list(map(lambda x: 1 if x != 0 else 0, v))
    
17.   r[4] = max(map(lambda x: x[0] if x[1] == 5 else 0,
    
18.                  enumerate(map(lambda x: sum(tmp[x-5:x]), range(5, 15)), start = 1)))
    
19.   r[3] = r[8] if len(list(filter(lambda x: x == 5, s))) == 1 else 0
    
20.   r[2] = r[5] if r[5] != 0 and r[7] != 0 else 0
    
21.   r[1] = max(map(lambda x: x[0] if x[1] == 4 else 0, enumerate(v)))
    
22.   r[0] = r[4] if r[4] != 0 and r[3] != 0 else 0
    
23.   return r
    
24. 
    
25. f = open('54.txt', 'r')
    
26. hand = list(map(lambda x: x.split(), filter(lambda x: len(x) != 0, f.read().split('\n'))))
    
27. print(len(list(filter(lambda x: fun(x[:5]) > fun(x[5:]), hand))))
    

复制代码

https://github.com/devinizz/project_euler/blob/master/page02/54.py
持续更新中...

debuggerzh

376

Process returned 0 (0x0)   execution time : 0.058 s
Press any key to continue.
十分赞同2#的看法……本题思维难度不大，但极为复杂，情况众多，很容易犯错
我想我的代码或许可以再优化些……

1. #include<algorithm>
   
2. #include<iostream>
   
3. #include<cstdio>
   
4. #include<string>
   
5. #include<cctype>
   
6. #include<map>
   
7. using namespace std;
   
8. 
   
9. const int M = 1000;
   
10. const string royal("TJQKA");
    
11. const string STRAIGHT("A23456789TJQKA");
    
12. string value[2],suit[2];
    
13. bool cmp(char i,char j);
    
14. 
    
15. int posi(char x){
    
16.   for (int i = 0;i < 5;i++)
    
17.     if (x == royal[i])  return i;
    
18. }
    
19. 
    
20. void erase_char(char c,string & s){
    
21.   do{
    
22.     s.erase(find(s.begin(),s.end(),c) );
    
23.   }while(find(s.begin(),s.end(),c) != s.end() );
    
24. }
    
25. 
    
26. bool p1win(const string & s1,const string & s2){
    
27.   for (int i = s1.length() - 1; i >= 0;i--){
    
28.     if (s1[i] == s2[i]) continue;
    
29.     if (!cmp(s1[i],s2[i]) )  return true;
    
30.     if (cmp(s1[i],s2[i]) )  return false;
    
31.   }
    
32. }
    
33. 
    
34. char dom(int p){
    
35.   map<char,int> times;  char domin;
    
36.   int mx = 0;
    
37. 
    
38.   for (int i = 0;i < value[p].length();i++){
    
39.     char t = value[p][i];
    
40. 
    
41.     if (!times.count(t) )  times[t] = 1;
    
42.     else times[t]++;
    
43.   }
    
44.   for (map<char,int>::iterator it = times.begin();it != times.end();++it)
    
45.     if (it->second > mx)  {mx = it->second; domin = it->first;}
    
46. 
    
47.   return domin;
    
48. }
    
49. 
    
50. bool cmp(char i,char j){
    
51.   if (isdigit(i) && isdigit(j)) return i < j;
    
52. 
    
53.   if (isdigit(i) && isalpha(j)) return true;
    
54.   if (isdigit(j) && isalpha(i)) return false;
    
55. 
    
56.   return posi(i) < posi(j);
    
57. }
    
58. 
    
59. bool is_straight(string & s){
    
60.   sort(s.begin(),s.end(),cmp);
    
61. 
    
62.   for (int i = 0;i < 10;i++)
    
63.     if (s == STRAIGHT.substr(i,5)) return true;
    
64. 
    
65.   return false;
    
66. }
    
67. 
    
68. bool isflush(string s){
    
69.   for (int i = 0;i < s.length() - 1;i++)
    
70.     if (s[i+1] != s[i]) return false;
    
71. 
    
72.   return true;
    
73. }
    
74. 
    
75. int others(string s){
    
76.   map<char,int> times;
    
77. 
    
78.   for (int i = 0;i < s.length();i++){
    
79.     char t = s[i];
    
80. 
    
81.     if (!times.count(t) )  times[t] = 1;
    
82.     else times[t]++;
    
83.   }
    
84.   int sz = times.size();
    
85.   if (sz == 5)  return 0;
    
86.   if (sz == 4)  return 1;
    
87.   if (sz == 2)  {
    
88.     for (map<char,int>::iterator it = times.begin();it != times.end();++it){
    
89.       if (it->second == 4)  return 7;
    
90.       if (it->second == 3)  return 6;
    
91.     }
    
92.   }
    
93.   if (sz == 3)  {
    
94.     for (map<char,int>::iterator it = times.begin();it != times.end();++it){
    
95.       if (it->second == 2)  return 2;
    
96.       if (it->second == 3)  return 3;
    
97.     }
    
98.   }
    
99.   return -1;//error
    
100. }
     
101. 
     
102. int judge_type(int p){
     
103.   bool f = isflush(suit[p]);
     
104.   bool st = is_straight(value[p]);
     
105. 
     
106.   if (f && st)  return 8;
     
107.   if (!f && st) return 4;
     
108.   if (f && !st) return 5;
     
109. 
     
110.   return others(value[p]);
     
111. 
     
112.   return -1;//error
     
113. }
     
114. /*  0:High Card         1:One Pair  2:Two Pairs
     
115.     3:Three of a Kind   4:Straight  5:Flush
     
116.     6:Full House        7:Four of a Kind
     
117.     8:Straight Flush
     
118. */
     
119. void print(){
     
120.   cout << value[0] << " " << value[1] << endl;
     
121.   cout << suit[0] << " " << suit[1] << endl << endl;
     
122. }
     
123. 
     
124. void ini(){
     
125.   for (int i = 0;i < 2;i++){
     
126.     value[i].clear();
     
127.     suit[i].clear();
     
128.   }
     
129. }
     
130. 
     
131. int main(){
     
132.   freopen("i.in","r",stdin);
     
133.   int cnt = 0;
     
134. 
     
135.   for (int r = 0;r < M;r++){
     
136.     ini();
     
137. 
     
138.     for (int i = 0;i < 2;i++){
     
139.       for (int j = 0;j < 5;j++){
     
140.         string s;
     
141.         cin >> s;
     
142.         value[i].push_back(s[0]);
     
143.         suit[i].push_back(s[1]);
     
144.       }
     
145.     }
     
146.     //print();
     
147. 
     
148.     int p1 = judge_type(0),p2 = judge_type(1);//此后,点数序列有序
     
149.     //cout << p1 << " " << p2 << endl;  cout << value[0] << " " << value[1] << endl;
     
150. 
     
151.     if (p1 > p2) {cnt++;  continue;}
     
152.     if (p1 == p2){
     
153.       switch(p1){
     
154.         case 0:
     
155.         case 5: if (p1win(value[0],value[1]) )  cnt++;
     
156.                 break;
     
157. 
     
158.         case 4:
     
159.         case 8: if (cmp(value[1][4],value[0][4]) )  cnt++;
     
160.                 break;
     
161. 
     
162.         case 1:
     
163.         case 3: {
     
164.           char c1 = dom(0),c2 = dom(1);
     
165.           if (c1 == c2) {
     
166.             string s1 = value[0],s2 = value[1];
     
167.             erase_char(c1,s1);  sort(s1.begin(),s1.end(),cmp);
     
168.             erase_char(c2,s2);  sort(s2.begin(),s2.end(),cmp);
     
169. 
     
170.             if (p1win(s1,s2)) {cnt++; break;}
     
171.           }
     
172.           if (cmp(c2,c1) )   cnt++;
     
173.           break;
     
174. 
     
175.         }
     
176.         case 6:
     
177.         case 7: {
     
178.           char c1 = dom(0),c2 = dom(1);
     
179.             if (c1 == c2){
     
180.               char d1,d2;
     
181.               for (int i = 0;i < 5;i++){
     
182.                 if (value[0][i] != c1) {d1 = value[0][i]; break;}
     
183.                 if (value[1][i] != c2) {d2 = value[1][i]; break;}
     
184.               }
     
185.               if (cmp(d2,d1) )  {cnt++; break;}
     
186.             }
     
187.             if (cmp(c2,c1) )   cnt++;
     
188.             break;
     
189. 
     
190.         }
     
191.         case 2: map<char,int> times[2];
     
192.                 string mypair[2];
     
193.                 char d[2];
     
194.                 for (int i = 0;i < 2;i++){
     
195.                   for (int j = 0;j < 5;j++){
     
196.                     char t = value[i][j];
     
197. 
     
198.                     if (!times[i].count(t) )  times[i][t] = 1;
     
199.                     else times[i][t]++;
     
200. 
     
201.                     if (times[i][t] == 2)  mypair[i].push_back(t);
     
202.                   }
     
203.                   for (map<char,int>::iterator it = times[i].begin();it != times[i].end();++it)
     
204.                     if (it->second = 1)   {d[i] = it->first;  break;}
     
205. 
     
206.                   sort(mypair[i].begin(),mypair[i].end(),cmp);
     
207.                 }
     
208.                 if (cmp(mypair[1][3],mypair[0][3]) )  {cnt++; break;}
     
209.                 else if (mypair[1][3] == mypair[0][3]){
     
210.                   if (cmp(mypair[1][0],mypair[0][0]) )  {cnt++; break;}
     
211.                   else if(mypair[1][0] == mypair[0][0]){
     
212.                     if (cmp(d[1],d[0]) )  {cnt++; break;}
     
213.                   }
     
214.                 }
     
215.       }
     
216.     }
     
217.   }
     
218.   cout << cnt << endl;
     
219.   return 0;
     
220. }
     

复制代码

永恒的蓝色梦想

实 际 开 发 实 况
我连题目都看不懂

B1tetheDust

1. import time as t
   
2. import numpy as np
   
3. 
   
4. start = t.perf_counter()
   
5. 
   
6. 
   
7. def evaluate_cards(suits, values):
   
8.     # Scores. Pair: 3; Three of a kind: 7; Straight: 8; Flush: 9; Four of a Kind: 11; Royal Flush: 18
   
9.     cards_value = 0
   
10.     set_values = set(values)
    
11.     is_straight = True
    
12.     if len(set(suits)) == 1:
    
13.         cards_value += 9
    
14.         if set_values == (8, 9, 10, 11, 12):
    
15.             cards_value += 9
    
16. 
    
17.     for value in range(4):
    
18.         if not (values[value + 1] - values[value] == 1):
    
19.             is_straight = False
    
20.     if is_straight:
    
21.         cards_value += 8
    
22. 
    
23.     dict_cards = {value: values.count(value) for value in values}
    
24.     pair_count, three_count, four_count = 0, 0, 0
    
25.     for value in dict_cards:
    
26.         if dict_cards[value] == 2:
    
27.             pair_count += 1
    
28.         elif dict_cards[value] == 3:
    
29.             three_count += 1
    
30.         elif dict_cards[value] == 4:
    
31.             four_count += 1
    
32.     cards_value += (pair_count * 3 + three_count * 7 + four_count * 11)
    
33. 
    
34.     return cards_value, dict_cards
    
35. 
    
36. 
    
37. def compare_cards(cards_list_1, cards_list_2):
    
38.     cards_order = ['2', '3', '4', '5', '6', '7', '8', '9', 'T', 'J', 'Q', 'K', 'A']
    
39.     values_1, suits_1, values_2, suits_2 = [], [], [], []
    
40.     for card in range(5):
    
41.         values_1.append(cards_order.index(cards_list_1[card][0]))
    
42.         suits_1.append(cards_list_1[card][1])
    
43.         values_2.append(cards_order.index(cards_list_2[card][0]))
    
44.         suits_2.append(cards_list_2[card][1])
    
45.     values_1.sort()
    
46.     values_2.sort()
    
47.     cards_value_1, cards_dict_1 = evaluate_cards(suits_1, values_1)
    
48.     cards_value_2, cards_dict_2 = evaluate_cards(suits_2, values_2)
    
49.     if cards_value_1 > cards_value_2:
    
50.         return True
    
51.     elif cards_value_1 < cards_value_2:
    
52.         return False
    
53.     elif cards_value_1 == 17 or cards_value_1 == 9 or cards_value_1 == 8 or cards_value_1 == 0:
    
54.         for max_value in range(-1, -6, -1):
    
55.             if values_1[max_value] > values_2[max_value]:
    
56.                 return True
    
57.             elif values_1[max_value] < values_2[max_value]:
    
58.                 return False
    
59.     elif cards_value_1 == 3 or cards_value_1 == 6 or cards_value_1 == 7 or cards_value_1 == 10 or cards_value_1 == 11:
    
60.         while True:
    
61.             if max(cards_dict_1.values()) > 1:
    
62.                 max_value_1 = max(cards_dict_1, key=lambda x: cards_dict_1[x])
    
63.                 max_value_2 = max(cards_dict_2, key=lambda x: cards_dict_2[x])
    
64.             else:
    
65.                 max_value_1 = max(cards_dict_1)
    
66.                 max_value_2 = max(cards_dict_2)
    
67.             if max_value_1 > max_value_2:
    
68.                 return True
    
69.             elif max_value_1 < max_value_2:
    
70.                 return False
    
71.             else:
    
72.                 cards_dict_1[max_value_1] = 0
    
73.                 cards_dict_2[max_value_2] = 0
    
74. 
    
75. 
    
76. hands = np.loadtxt('C:/Users/wuhw/Desktop/p054_poker.txt', dtype=str)
    
77. count_1_win = 0
    
78. for all_cards in hands:
    
79.     cards_list = list(all_cards)
    
80.     res = compare_cards(cards_list[:5], cards_list[5:])
    
81.     if res:
    
82.         count_1_win += 1
    
83. 
    
84. print(count_1_win)
    
85. print("It costs %f s" % (t.perf_counter() - start))
    

复制代码

376
It costs 0.038529 s
浪费一个小时做这个破题，我真的是个傻逼