写个最大子序和吧~

连续子序列和最大

def max_sub_array(nums):
    tmp, next_ = nums[0], nums[0] # 保存备查表最近的相邻两项
    max_value = nums[0]
    for i in range(1, len(nums)):
        next_ = tmp + nums[i] if tmp > 0 else nums[i]
        if max_value < next_:
            max_value = next_
        tmp = next_
    return max_value

# 测试通过
nums = [-2,1,-3,4,-1,2,1,-5,4]
print(max_sub_array(nums)) # [4, -1, 2, 1] 为最大连续子序列

动态规划