Climbing Stairs【动规递推】

PROBLEM:

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?

Note: Given n will be a positive integer.

SOLVE:

解释：其实这是一个斐波那契亚数列问题，“n级台阶的行走方法=（n-1）级台阶的行走方法+（n-2）级台阶的行走方法”。

下面是递归写法，由于里面设计到太多重复计算，实现起来效率太低！

class Solution {
public:
    int climbStairs(int n) {
        if(n>2)
            return climbStairs(n-1)+climbStairs(n-2);
        else if(n==2)
            return 2;
        else
            return 1;
    }
};

下面是迭代写法，时间复杂度为O（n）！

class Solution {
public:
    int climbStairs(int n) {
        int first=0,second=1,output=0;
        for(int i=1;i<=n;i++){
            output=first+second;
            first=second;
            second=output;
        }
        return output;
    }
};