题解 | 跳台阶

水题，经典dp，转移是显然的。

class Solution {
public:
    int jumpFloor(int number) {
        int n = number;

        std::vector<int> dp(n + 1);
        dp[0] = dp[1] = 1;
        for (int i = 2; i <= n; i++) {
            dp[i] = dp[i - 1] + dp[i - 2];
        }

        return dp[n];
    }
};

https://www.nowcoder.com/discuss/727521113110073344