码迷,mamicode.com
首页 > 其他好文 > 详细

Climbing Stairs

时间:2014-06-04 19:53:34      阅读:173      评论:0      收藏:0      [点我收藏+]

标签:c   style   class   blog   code   java   

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?

bubuko.com,布布扣
class Solution {
public:
    int climbStairs(int n) {
        int step[n];
        step[0]=1;
        step[1]=1;
        for(int i=2;i<=n;i++)
            step[i]=step[i-1]+step[i-2];
        return step[n];
    }
};
bubuko.com,布布扣

Climbing Stairs,布布扣,bubuko.com

Climbing Stairs

标签:c   style   class   blog   code   java   

原文地址:http://www.cnblogs.com/erictanghu/p/3759474.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!