剑指offer-跳台阶

题目地址：https://www.nowcoder.com/practice/8c82a5b80378478f9484d87d1c5f12a4?tpId=13&&tqId=11161&rp=1&ru=/activity/oj&qru=/ta/coding-interviews/question-ranking

此题与斐波拉契思路一模一样，DP，再采用状态压缩

class Solution {
public:
    int jumpFloor(int number) {
        if(number==1)return 1;
        if(number==2)return 2;
        int l1=1,l2=2;
        for(int i=3;i<=number;++i){
            int temp=l1+l2;
            l1=l2;
            l2=temp;
        }
        return l2;
    }
};