擅长:python、mysql、java
<p>我会建立一个所有卡片的排序列表,然后你可以通过查找给定卡片的索引并返回列表中的所有卡片来快速获得高于给定卡片的所有卡片。例如:</p>
<pre><code>class card:
'Fields: suit, value'
def __init__(self, suit, value):
self.suit = suit
self.value = value
def __repr__(self):
return '{suit} {value}'.format(suit=self.suit,value=self.value)
def __eq__(self, other):
return (isinstance(other, self.__class__) and
self.suit == other.suit and self.value == other.value)
all_cards = [card(s, v)
for s in ('clubs', 'diamonds', 'hearts', 'spades')
for v in range(1, 11)]
def higher_in_rank(base_card):
return all_cards[all_cards.index(base_card)+1:]
</code></pre>
<p>示例:</p>
^{pr2}$