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

LeetCode Climbing Stairs

时间:2015-04-03 15:27:25      阅读:115      评论: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?

题意: 求上n个台阶的方法数,要么走一步,要么两步。

思路:递归超时,递推

class Solution {
public:
    int climbStairs(int n) {
        if (n <= 2) return n;

        int f[1000];
        f[1] = 1, f[2] = 2;
        for (int i = 3; i <= n; i++)
            f[i] = f[i-1] + f[i-2];

        return f[n];
    }
};


LeetCode Climbing Stairs

标签:

原文地址:http://blog.csdn.net/u011345136/article/details/44854243

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