python版二叉树 全re 测试用例没问题
查看原帖
python版二叉树 全re 测试用例没问题
1255023
liu611楼主2024/3/4 12:16
def dfs(x):
    if (x>=2**n):
        return
    else:
        dfs(2*x)
        dfs(2*x+1)
        lvalue=value[2*x]
        rvalue=value[2*x+1]
        if lvalue>rvalue:
            value[x]=lvalue
            winner[x]=winner[2*x]
        else:
            value[x]=rvalue
            winner[x]=winner[2*x+1]

a=2**n
value=[0]*a
winner=[0]*a
for i in range(2**n):
    value.append(score[i])
    winner.append(i+1)
dfs(1)
ans=winner[3] if value[2]>value[3] else winner[2]
print(ans)
2024/3/4 12:16
加载中...