题解 | #查找兄弟单词#
查找兄弟单词
https://www.nowcoder.com/practice/03ba8aeeef73400ca7a37a5f3370fe68
s = input().split()
n = int(s[0])
words = s[1:n+1]
x = s[-2]
k = int(s[-1])
l = []
for word in words:
if word != x and sorted(word) == sorted(x):
l.append(word)
print(len(l))
if k <= len(l):
print(sorted(l)[k-1])
联想公司氛围 250人发布
