题解 | 查找兄弟单词
查找兄弟单词
https://www.nowcoder.com/practice/03ba8aeeef73400ca7a37a5f3370fe68
d = input().split()
x = d[-2]
l = []
min = int(d[-1]) - 1
for s in d[1:-2]:
if sorted(s) == sorted(x) and s != x:
l.append(s)
l.sort()
print(len(l))
if len(l) >= min and l:
print(l[min])
查看5道真题和解析
