![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
动态规划
文章平均质量分 66
_离岛_
人海边的离岛。
展开
-
leetcode之70. Climbing Stairs(C++解法 动态规划思想)
原题: You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?*****************************我是一原创 2016-09-21 15:19:49 · 1498 阅读 · 0 评论 -
leetcode之392. Is Subsequence(C++解法 动态规划 贪心 模式匹配)
模式匹配,字符串查找,动态规划原创 2016-09-21 18:31:00 · 3107 阅读 · 0 评论