题解 | #跳台阶#青蛙跳台阶，迭代法

class Solution {
public:
    int diedai(int n)
    {
        if(n==1)
            return 1;
        if(n==2)
            return 2;
        return diedai(n-1)+diedai(n-2);
    }
    int jumpFloor(int number) 
    {
        return diedai(number);
    }
};