2024.10.16 华为笔试题解

第一题

递归建树之后模拟即可

class Node:
    def __init__(self, v) -> None:
        self.val=v
        self.left=None
        self.right=None

def build_tree(node_arr):
    if not node_arr:
        return None
    mid = (len(node_arr)-1)//2
    root = Node(node_arr[mid])
    root.left = build_tree(node_arr[:mid])
    root.right = build_tree(node_arr[mid+1:])
    return root

def get_leafs(root):
    if root is None:
        return []
    if root.left is None and root.right is None:
        return [root.val]
    return get_leafs(root.left)+get_leafs(root.right)

def func():
    n, *node_v = list(map(int, input().split()))
    q_data = list(map(int, input().split()))
    q, min_v, max_v=q_data[0], q_dat