Skip to content

Instantly share code, notes, and snippets.

@taoso
taoso / gist:9369105
Last active August 29, 2015 13:57
最大和路径动态规划算法
import random
# 三角矩阵行数
n = 9
# 生成随机三角矩阵
a = []
for i in range(n):
a.append([])
for j in range(i+1):
a[i].append(random.randint(1, 10))
# 初始化中间变量