摘要：
class TreeNode: def __init__(self, val): self.val = val self.left = None self.right = None class OperationTree: def insert(self, root, val): if root is None:... 阅读全文
摘要：
a = [-2, 1, 3, 4, -7, 5, -6, 2, 7] def foo(arr): res = arr[0] # 保存最大的累计和 arr_sum = 0 # 保存累计和 for num in arr: if arr_sum > 0: arr_sum += num # 累计和为非负，有继续累加的意义 ... 阅读全文
摘要：
# 求解最优性的问题 # 线性动规 # 区域动归 a = [1, 3, 4, 5, 6, 2, 7] def foo(arr): if len(arr) <= 1: return 0 min_num = arr[0] max_num = 0 for item in arr: history = item - min_num... 阅读全文