题解 | 查找兄弟单词
查找兄弟单词
https://www.nowcoder.com/practice/03ba8aeeef73400ca7a37a5f3370fe68
I = input().split()
n = int(I[0])
s = I[1 : n + 1]
bs = []
x = I[n + 1]
k = int(I[n + 2])
for word in s:
if word == x:
continue
if sorted(word) == sorted(x):
bs.append(word)
print(len(bs))
if k < len(bs) + 1:
print(sorted(bs)[k - 1])
这样才显得专业
查看8道真题和解析