撸了个Python版本 def find_common_an(): unordered_map = {} _ = input() counts = int(input()) for i in range(counts): num_list = [int(i) for i in input().split()] par = num_list[0] cnt = num_list[1] for j in range(cnt): unordered_map[num_list[j+2]] = par virus_list = [int(i) for i in input().split()] v_l = virus_list[1:] common = min(v_l) while v_l.count(common) != len(v_l): for i in range(len(v_l)): if v_l[i] > common: v_l[i] = unordered_map[v_l[i]] else: common = v_l[i] print(common) find_common_an()
点赞 评论

相关推荐

牛客网
牛客企业服务