（原）剑指offer跳台阶和矩形覆盖

class Solution {
public:
  int jumpFloor(int number) {
    long long fiboncciA = 1;
        long long fiboncciB = 2;
        if (number == 1){
            return fiboncciA;
        }
        if (number == 2) {
            return fiboncciB;
        }
         
        int i;
        for (i = 3; i <= number; i++){
            int tmp = fiboncciB;
            fiboncciB = fiboncciA + fiboncciB;
            fiboncciA = tmp;
        }
        return fiboncciB;
  }
};