JZ8 跳台阶

public class Solution {
    public int jumpFloor(int target) {
        if(target<=2)
        {
            return target;
            
        }
        int a=1,b=2;
        for(int i=3;i<=target;i++)
        {
            int c=a+b;
            a=b;
            b=c;
        }
            return b;
    }
}

相当于菲波那切数列 分类来看
f[i]=f[i-1]+f[i-2] i>=3
i=1 1
i=2 2