擅长:python、mysql、java
<pre><code>RANK_ORDER = '34567890JQKA2'
SUIT_ORDER = 'DCHS'
def rank(card):
return RANK_ORDER.find(card[0])
def suit(card):
return SUIT_ORDER.find(card[1])
def is_higher_pair(pair1, pair2):
if rank(pair1[0]) != rank(pair2[0]):
# return True if pair1 has the highest rank
return rank(pair1[0]) > rank(pair2[0])
# return True if pair1 has the highest suit
return suit(max(pair1, key=suit)) > suit(max(pair2, key=suit))
if __name__ == "__main__":
print(is_higher_pair(["AH", "AD"], ["8D", "8S"]))
print(is_higher_pair(["JS", "JD"], ["2D", "2S"]))
print(is_higher_pair(["6D", "6S"], ["6H", "6C"]))
print(is_higher_pair(["KH", "KS"], ["KD", "KC"]))
print(is_higher_pair(["0H", "0D"], ["0S", "0C"]))
</code></pre>
<p>我认为这是op想要的功能,它可以最小化比较。它确实假设一对是有效的一对,并且卡片是唯一的</p>