51 -算法 -斐波拉奇数列 -LeetCode 70 -递推

// 斐波拉奇数列 
//  递归 和 递推 

static int count = 0;
class Solution {
public:
    int climbStairs(int n) {
        if(n == 1 || n == 0) return 1;
        if(n == 2) return 2;
        int s1 = 1;  //f(n-1) -f(1)
        int s2 = 2; //f(n-2)  -f(2)
        int temp = 0;
        for(int i=3;i<=n;i++)  // *斜体样式*
        {
            temp = s2;
            s2 = s1 + s2;
            s1 = temp;
        }
        return s2;
    }
};