题解 | 跳台阶

class Solution {
public:
    int jumpFloor(int number) {
        vector<int> dp(number + 1);
        dp[0] = 1, dp[1] = 1;
        for (int i = 2; i <= number; i++) {
            dp[i] = dp[i - 1] + dp[i - 2];
        }
        return dp[number];
    }
};