数据结构与算法A实验七查找(PYTHON）

n=int(input())
lis={}
for i in range(n):
    a,b=input().split(" ");
    if a not in lis:
        lis[a]=1
    else:
        lis[a]+=1
    if b not in lis:
        lis[b]=1
    else:
        lis[b]+=1
mx=-1
num=0
for i in lis.keys():
    if lis[i]==mx:
        num+=1
        if ans>i:
            ans=i
    elif lis[i]>mx:
        num=1
        ans= i
        mx=lis[i]
if num==1:
    print(ans,mx)
else:
    print(ans,mx,num)

n=int(input())
lis=list(map(int,input().split(" ")))+list(map(int,input().split(" ")))
lis.sort()
print(lis[n-1])

import sys
s = sys.stdin.read()
s = s[:s.find("#")]
for k in set([i for i in s if i.isalnum()==False and i!='_']):
    s = s.replace(k,' ')#除字母数字和_外都看作空格
t = s.rstrip().lower().split()#去除末尾空格#.split()生成单词列表
d = {}
for i in t:
    d[i[:15]] = d.get(i[:15],0)+1
res = sorted(d.items(),key=lambda x:(-x[1],x[0]))#value降序key升序#转为相反数即升序
print(len(res))
for i in range(int(len(res)/10)):
    print(str(res[i][1])+":"+res[i][0])

n=int(input())
a=[]
i=0
while i 
7-5 悄悄关注 (25 分) 
l=input().split()
n=int(input())
del l[0]
dic={}
sum=0
for i in range(n):
    a,b=input().split()
    b=int(b)
    sum+=b
    dic[a]=b

sum/=n
res=[]
for i in l:
    dic[i]=-1
for i in dic:
    if  dic[i]>sum:
        res.append(i)
res.sort()
for i in res:
    print(i)
if len(res)==0:
    print("Bing Mei You")
 
7-6 单身狗 (25 分) 
a=int(input())
l=[input().split() for i in range(a)]
ll={}
for i in l:
    ll[i[0]]=i[1]
    ll[i[1]]=i[0]
m,l2=input(),set(input().split())
l3=list(sorted([i for i in l2 if ll.get(i,"0") not in l2]))
print(len(l3))
if len(l3):
    print(*l3)

 
7-7 词典 (15 分) 
n,m=map(int,input().split())
dic={}
for i in range(n):
    a,b=input().split()
    dic[b]=a
for i in range(m):
    a=input();
    if a not in dic.keys():
        print("eh")
    else:
        print(dic[a])



 
7-8 中序遍历树并判断是否为二叉搜索树 (20 分)
 
lis=[]
def solve( x):
    if x in lt.keys():
        solve(lt[x])
    print(x)
    lis.append(x)
    if x in rt.keys():
        solve(rt[x])
n=int(input())
lt,rt={},{}
if n==0:
    print("Yes")
else:
    k=int(input())
    flag=True
    for i in range(n-1):
        r,d,e=map(int,input().split())
        if d==0:
            lt[r]=e
        else:
            rt[r]=e
solve(k)
if lis==sorted(lis):
    print("Yes")
else:
    print("No")