#动态规划
chuck_zch
慢慢的爬
展开
-
__70. 爬楼梯
def stairs_jumps(n): if n is None: return if n <= 2: return n dp = [0 for _ in range(n)] dp[0], dp[1] = 1, 2 for i in range(2, n): dp[i] = dp[i - 1] + d...原创 2019-10-21 22:30:26 · 69 阅读 · 0 评论 -
__动态规划__斐波那契数列
def dynamic_fibonacci(n): if n is None: return if n <= 2: return 1 dp = [0 for _ in range(n)] dp[0], dp[1] = 1, 1 for i in range(2, n): dp[i] = dp[i - 1...原创 2019-10-21 22:23:02 · 82 阅读 · 0 评论 -
__64. 最小路径和
def plan_path_min(path): if path is None: return m, n = len(path), len(path[0]) dp = [[0 for _ in range(n)] for _ in range(m)] dp[0][0] = path[0][0] for i in range(1, m):...原创 2019-10-21 22:13:08 · 89 阅读 · 0 评论 -
__63. 不同路径 II
def path_types_obstacle(path): if path is None: return m, n = len(path), len(path[0]) dp = [[0 for _ in range(n)] for _ in range(m)] if path[0][0] == 0: dp[0][0] = 1 ...原创 2019-10-21 22:11:38 · 71 阅读 · 0 评论 -
__62. 不同路径
def path_types(path): if path is None: return m, n = len(path), len(path[0]) # m, n = 7, 3 # 题目要求 dp = [[0 for _ in range(n)] for _ in range(m)] # 1. 注意 dp[0][0] = 1 f...原创 2019-10-21 21:56:02 · 55 阅读 · 0 评论