70. Climbing Stairs

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:   1  2  3  4  5  6  7  8.......

num:  1  2  3  5  8  13  21  34.....

第i个数为第i-1与i-2之和；

那么就可以计算：

class Solution {
public:
    int climbStairs(int n) {
        if(n==1||n==2||n==0)return n;
        int *r = new int[n];
        r[0]=1;
        r[1]=2;
        for(int i=2;i<n;i++){
            r[i]=r[i-1]+r[i-2];
        }
        return r[n-1];
    }
};