leetcode 746.爬樓梯的最小代價（從暴力遞歸到動態規劃）

題目：java 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 cost to reach th

>>阅读原文<<