剑指 offer 小青蛙跳台阶

class Solution {
public:
    int jumpFloor(int number) {
    int array[2] = {0,1};
        if (number<2){
            return array[number];
        }
        else{
             long long one =1;
             long long two =1;
             long long sum =0;
             for (long long i = 2;i<=number;i++){
                sum = one + two;
                one = two;
                two = sum;
             }
            return sum;
        }
       
        
    
    }
};