2018年1月24日
[LeetCode] 746. 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. Y 阅读全文
posted @ 2018-01-24 22:27 Grandyang 阅读(10209) 评论(4) 推荐(1)
Fork me on GitHub