https://www.nowcoder.com/practice/8c82a5b80378478f9484d87d1c5f12a4?

class Solution {
public:
    int jumpFloor(int number) {
        int* dp = new int[number+1];

        dp[1]=1;
        dp[2]=2;
        for(int i=3; i<=number; i++)
        {
            dp[i]=dp[i-1]+dp[i-2];
        }

        int rnum=dp[number];
        delete[] dp;

        return rnum;
    }
};

https://www.nowcoder.com/practice/72a5a919508a4251859fb2cfb987a0e6?

class Solution {
public:
    int rectCover(int number) {
        int* dp = new int[number+1];

        dp[1]=1;
        dp[2]=2;
        for(int i=3; i<=number; i++)
        {
            dp[i]=dp[i-1]+dp[i-2];
        }

        int rnum=dp[number];
        delete[] dp;

        return rnum;
    }
};