题解 | #跳台阶#

1.简单动态规划

class Solution {
public:
    int jumpFloor(int number) {
        int a0=1,a1=1;
        for(int i=1;i<number;i++) {
            int temp = a0+a1;
            a0 = a1;
            a1 = temp;
        }
        return a1;
    }
};