dynamic-programming-python-leetcode（动态规划）

1、Min Cost Climbing Stairs On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed). Once you pay the cost, you can either climb one or two steps. You need to find minimum

>>阅读原文<<