首页 > 其他 > 详细

70. Climbing Stairs Add to List

时间:2016-12-30 20:37:37      阅读:147      评论:0      收藏:0      [点我收藏+]

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?

 

Subscribe to see which companies asked this question

///////////233333333一看题有点动态规划和组合的概念

///////////斐波那契数列

 1 class Solution {
 2 public:
 3     int climbStairs(int n) {
 4         if(n<=0)
 5             return 0;
 6         int p[n];
 7         p[0]=0;
 8         p[1]=1;
 9         p[2]=2;
10         for(int i=3;i<=n;i++)
11             p[i]=p[i-1]+p[i-2];
12         return p[n];
13     }
14 };

 

70. Climbing Stairs Add to List

原文:http://www.cnblogs.com/hutonm/p/6238012.html

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