变态跳台阶（C 牛客网）

解题思路：dp[n]=dp[n-1]+dp[n-2]+dp[n-3]+....dp[1]+dp[0]，dp[0]=dp[1]=1

class Solution {
public:
    int jumpFloorII(int number) {
        if (number==0 || number==1) return 1;
        int *dp = new int[number+1];
        dp[0]=1,dp[1]=1;
        int sum=2;
        for (int i=2;i<=number;i++) {
            dp[i]=sum;
            sum+=dp[i];
        }
        return dp[number];
    }
};