题解 | 查找兄弟单词

data_list = list(input().split())    # 获得数据列表，建立空列表，拆分数据
s_list = []
bro_list = []
n = int(data_list[0])
x = data_list[-2]
k = int(data_list[-1])

for i in range(n):    # 获得n个字符串列表
    s_list.append(data_list[i + 1])

for i in s_list:    # 获得兄弟单词
    if i == x:    # 不可为自己
        continue
    elif len(i) != len(x):    # 长度需一致
        continue
    elif sorted(i) == sorted(x):    # 用sorted()排序来保证单词中字符出现频次一致
        bro_list.append(i)

print(len(bro_list))
new_bro_list = sorted(bro_list)
if len(new_bro_list) >= k:    # 判断是否有第k个兄弟单词
    print(new_bro_list[k - 1])