修剪叶子【Python实现】
class TreeNode: def __init__(self, val=0, left=None, right=None): self.val = val self.left = left self.right = rightclass Solution
class TreeNode: def __init__(self, val=0, left=None, right=None): self.val = val self.left = left self.right = rightclass Solution
m = map(int, input.split)times = for _ in range(n):x, y = map(int, input.split)times.append(x + y)times.sortcount = 0last_pick =