跳台阶（C 牛客网）

解题思路：动态规划 dp[i]=dp[i-1]+dp[i-2]

class Solution {
public:
    int jumpFloor(int number) {
        if (number==0) return 0;
        if (number==1) return 1;
        if (number==2) return 2;
        int *dp = new int[number+1];
        dp[1]=1;
        dp[2]=2;
        for (int i=3;i<=number;i++) 
            dp[i]=dp[i-1]+dp[i-2];
        return dp[number];
    }
};