leetcode70 C++ 4ms 爬楼梯 菲波那切数列

class Solution {
public:
    int climbStairs(int n) {
        int a = 1;
        int b = 1;
        int temp;
        while(n>0){
            n--;
            temp = a;
            a = b;
            b += temp;
        }
        return a;
    }
};

原文地址：https://www.cnblogs.com/theodoric008/p/9413343.html