70.leetcode Climbing Stairs(easy)[递推表示式 斐波那契数列]

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?

这个题目可以采用动态规划或者递推表达式来完成，f(n) = f(n-1)+f(n-2),就是说在n个阶梯可以是从n-1阶梯的基础上走一步完成的，也可以是n-2阶梯的基础上走两步完成的。f(1) = 1,f(0) =1;

class Solution {
public:
    int climbStairs(int n) {
        int a[n+1];
        a[0] = 1;
        a[1] = 1;
        //a[2] = 2;
        for(int i= 2;i<=n;i++)
        {
            a[i] = a[i-1]+a[i-2];
        }
        return a[n];
    }
};