LeetCode刷題——Array篇(Min Cost Climbing Stairs)

On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed).web Once you pay the cost, you can either climb one or two steps. You need to find minimum cost to reach the top o

>>阅读原文<<