[LeetCode-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?

---

Solution[C++]:

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