Solution

• 动态规划

class Solution {
public:
    int jumpFloorII(int number) {
        if (number < 2) return number;
        
        vector<int> dp(number + 1, 0);
        dp[0] = 1;
        for (int i = 1; i <= number; ++i) { // 遍历背包
            for (int j = 1; j <= number; ++j) { // 遍历物品
                if (i - j >= 0) dp[i] += dp[i-j];
            }
        }
        return dp[number];
    }
};