题解 | #查找兄弟单词#

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

while True:
    try:
        li=input().split()
        #取到判断兄弟单词的原词,并排序
        str0=li[-2]
        arr0=list(str0)
        arr0.sort()
        str1=''.join(arr0)
        #定义一个数组存放兄弟单词
        arr=[]
        if 1<=int(li[0])<=1000 and 1<=int(li[-1])<int(li[0]):
            m,n=0,0
            for i in range(1,int(li[0])+1):
                if 1<=len(li[i])<=10:
                    if len(li[i])==len(str0) and li[i]!= str0:
                        arr1=list(li[i])
                        arr1.sort()
                        str2=''.join(arr1)
                        if str2==str1:
                            arr.append(li[i])
                        else:
                            m+=1
                    else:
                        m+=1
                else:
                    n=1
                    break
            if n==1:
                continue
            if m==int(li[0]):
                print(0)
                break

            print(len(arr))
            arr.sort()
            print(arr[int(li[-1])-1])
        else:
            continue
        break
    except:
        break

全部评论

相关推荐

点赞 评论 收藏
分享
点赞 收藏 评论
分享
牛客网
牛客企业服务