2024.10.23华为笔试题解
第一题栈溢出判断
给出的是一个dag图也就是有向无环图，dfs记录一下路径即可
from collections import defaultdict
start = [0]
n0 = int(input())
fun_dict = defaultdict(dict)
for i in range(n0):
a,b = input().split()
fun_dict[a] = int(b)
n1 = int(input())
pro_dict = defaultdict(dict)
for j in range(n1):
a = list(map(str,input().split()))
pro_dict[str(a[0])] = ''.join(map(str,a[1:]))
if start[0] == 0:
start[0] = str(a[0])
s = 0
in_out = 'false'
ma = int(input())
queery = ['0']
res = defaultdict(dict)
max1 = 0
resu = 0
def dfs(n,f,queery):
global max1 ,resu,s,in_out,res
if resu == 0:
s = 0
queery = qu