70-Climbing Stairs

题目

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?

Note: Given n will be a positive integer.

分析

利用Fibonacci 数列来做这个问题，

即F(n) = F(n-1)+F(n-2)

实现

/*
Algorithm:70 Climb Stairs
Date:2017-02-27
Time Complexity: 
Space Complexity:O(n)

*/

class Solution {
public:
    int climbStairs(int n) {
        if (n <= 0)
            return 0;
        if (n == 1)
            return 1;
        if (n == 2)
            return 2;
        vector<int> number(n + 1, 0);
        number[1] = 1;
        number[2] = 2;
        for (int i = 3; i <= n; i++)
        {
            number[i] = number[i - 1] + number[i - 2];
        }


        return number[n];


    }
};