首页 > 其他 > 详细

leetcode 70 Climbing Stairs

时间:2015-04-29 19:50:11      阅读:200      评论:0      收藏:0      [点我收藏+]

Climbing Stairs
                     

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?

Hide Tags



这个题面试题还是比较常见的
讨论的帖子:





DP算法求解:

简洁的代码:

递归:

python:



leetcode 70 Climbing Stairs

原文:http://blog.csdn.net/wangyaninglm/article/details/45369627

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!