腾讯2021校园招聘技术类编程题汇总

第一题

代码：

'''
    author: 'Qingmang'
    data: "2022/9/8 16:26"
    email: "1107438760@qq.com"
'''
import sys  # 导入sys模块
sys.setrecursionlimit(30000) #如果不设置这行的话 则会超出最大递归层数
def dfs(nums:dict[int:list[int]],visited:set[int],index:int):
    if index in visited:
        return
    else:
        visited.add(index)
        if index not in nums.keys():
            return
        for i in nums[index]:
            if i not in visited:
                    dfs(nums,visited,i)
if __name__ == '__main__':
    T = int(input())
    ans = []
    for i in range(T):
        n = int(input())
        nums = {}
        data = set()
        for j in range(n):
            x,y = input().split(" ")
            x = int(x)
            y = int(y)
            data.add(x)
            if x not in nums.keys():
                nums[x] = [y]
            else:
                nums[x].append(y)
            if y not in nums.keys():
                nums[y] = [x]
            else:
                nums[y].append(x)
        visited = set()
        res,curcount = 1,0
        for index in data:
            if index in visited:
                continue
            curcount = len(visited)
            dfs(nums,visited,index)
            if len(visited)-curcount>res:
                res = len(visited)-curcount
        ans.append(res)
    for i in ans:
        print(i)