题解 | #查找兄弟单词#
查找兄弟单词
http://www.nowcoder.com/practice/03ba8aeeef73400ca7a37a5f3370fe68
该题不难,主要是怎么判断是不是兄弟的字符串,只要是里面的每个字符的数量是一样的,那么肯定是兄弟字符串,所以首先定义了1个函数,返回值是1个字典,用来记录里面每个字符的个数:
def dic1forstr(str1):
dic1={}
for i in str1:
if i not in dic1.keys():
dic1[i]=1
else:
dic1[i]+=1
return dic1
while True:
try:
s=input().split()
index=int(s[-1])
oristr=s[-2]
liststr=s[1:int(s[0])+1]
# print(liststr)
# print(oristr)
# print(index)
list2=[]
for i in liststr:
if i!=oristr and dic1forstr(i)==dic1forstr(oristr):
list2.append(i)
list2.sort()
# print(list2)
print(len(list2))
print(list2[index-1])
except:
break
dic1={}
for i in str1:
if i not in dic1.keys():
dic1[i]=1
else:
dic1[i]+=1
return dic1
while True:
try:
s=input().split()
index=int(s[-1])
oristr=s[-2]
liststr=s[1:int(s[0])+1]
# print(liststr)
# print(oristr)
# print(index)
list2=[]
for i in liststr:
if i!=oristr and dic1forstr(i)==dic1forstr(oristr):
list2.append(i)
list2.sort()
# print(list2)
print(len(list2))
print(list2[index-1])
except:
break
查看18道真题和解析