2.1.17 Climbing Stairs

Notes: You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Solution: Clime one step from last stair or clime 2 steps from the last last stair.

 爬楼梯，就是斐波纳契数列。

int climbStairs(int n) 
{
    int a = 1, b = 2;
    int c = 0;
    
    if (n == 1) return a;
    if (n == 2) return b;
    
    for (int i = 2; i < n; ++i)
    {
        c = a + b;
        a = b;
        b = c;
    }
    
    return c;
}