题解 | #查找兄弟单词#

查找兄弟单词

https://www.nowcoder.com/practice/03ba8aeeef73400ca7a37a5f3370fe68

# data = input().split()
# num = int(data[0])
# dic = data[1:num+1]
# word = data[num+1]
# idx = int(data[num+2])

# id = 0
# re = []
# for wd in dic:
#     if sorted(wd) == sorted(word) and wd != word:
#         re.append(wd) 
#         pass
# re = sorted(re)

# print(len(re))
# try:
#     print(re[idx-1])
# except:
#     pass

astr = input().split()
num = int(astr[0])
re_bro = []
word = astr[num + 1]
search_idx = int(astr[num+2])
for i in range(1, num+1):
    if astr[i] != word and sorted(astr[i]) == sorted(word):
        re_bro.append(astr[i])
re_bro = sorted(re_bro)
print(len(re_bro))
if search_idx > len(re_bro):
    pass
else:
    print(re_bro[search_idx-1])

全部评论

相关推荐

03-03 10:35
3d人士会梦见住进比弗利山庄吗:这四个项目属于是初学者的玩具了。不知道面试官咋问,而且双非本搞算法除了9,还是保守至少c9
点赞 评论 收藏
分享
评论
点赞
收藏
分享

创作者周榜

更多
牛客网
牛客企业服务