n = 5 d = {'33956':['27538','84925'],'79731':['91415','25288'],'25288':['33956']} def findmax(d): res = [] visited = [] for x in d: if x in visited: continue visited.append(x) tem = d[x].copy() rt = 0 while tem: print(tem) ...
投递哔哩哔哩等公司10个岗位 > 
向宇同桌：企业出题都是这样的，不然每个语言都要写一个输入输出，企业出题人也没这个本事啊。