擅长:python、mysql、java
<p>我现在不知道代码是如何工作的,因为您还没有向我们展示<code>numpair()</code>、<code>detset()</code>和<code>quads()</code>的代码。你知道吗</p>
<p>但是,如果我能从容不迫地工作,我会这样做:</p>
<pre><code># assume rank values are numeric 2-10, J=11, Q=12, K=13, A=14
# iterate over each rank 2 thru 10
for rank in range(2, 11):
# if rank+0, rank+1, rank+2, rank+3, and rank+4 are all present, we have a straight
if all(rank+n in vset for n in range(0,5)):
print 'we have a straight'
break
# if we never broke out of the loop, we never found a straight
else:
print 'we do not have a straight'
</code></pre>