华为od 斗地主之顺子 python
import numpy as np
n = input().split(' ')
l = []
for i in range(len(n)):
if n[i] == 'J':
n[i] = '11'
elif n[i] == 'Q':
n[i] = '12'
elif n[i] == 'K':
n[i] = '13'
elif n[i] == 'A':
n[i] = '14'
l.append(int(n[i]))
for num in l:
if num == 2:
l.remove(num)
l.sort()
l = np.unique(l)
res = []
res.append(l[0])
#print(l)
a = 1
while a < len(l):
for b in l:
if b+1 == l[a]:
res.append(l[a])
a+=1
count = 0
for i in res:
if i == 11:
i = 'J'
elif i == 12:
i = 'Q'
elif i == 13:
i = 'K'
elif i == 14:
i = 'A'
print(i,end=' ')
count+=1
if count%5==0:
print('\n')
哎,看错题了以为5个来的顺子
n = input().split(' ')
l = []
for i in range(len(n)):
if n[i] == 'J':
n[i] = '11'
elif n[i] == 'Q':
n[i] = '12'
elif n[i] == 'K':
n[i] = '13'
elif n[i] == 'A':
n[i] = '14'
l.append(int(n[i]))
for num in l:
if num == 2:
l.remove(num)
l.sort()
l = np.unique(l)
res = []
res.append(l[0])
#print(l)
a = 1
while a < len(l):
for b in l:
if b+1 == l[a]:
res.append(l[a])
a+=1
count = 0
for i in res:
if i == 11:
i = 'J'
elif i == 12:
i = 'Q'
elif i == 13:
i = 'K'
elif i == 14:
i = 'A'
print(i,end=' ')
count+=1
if count%5==0:
print('\n')
哎,看错题了以为5个来的顺子
全部评论
相关推荐
点赞 评论 收藏
分享