题解 | #跳台阶#

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