leetcode-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 step 阅读全文
posted @ 2018-03-27 20:52 Guo磊 阅读(112) 评论(0) 推荐(0) 编辑
