#使用递归即可,和【HJ67 24点游戏算法】类似 def check(l,n): ss=[0,'A','2','3','4','5','6','7','8','9','10','J','Q','K'] if len(l)==1: if ss.index(l[0])==n: return l[0] else: return None else: for i in range(len(l)): ls=l[:i]+l[i+1:] m...