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.

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

到达第n阶的情况有两种，一种是由n-1阶到达n阶，一种是由n-2阶到达n阶。假设：到达n-1阶一共由dp[n-1]中情况，到达n-2阶有dp[n-2]中情况。由于最后一步走1阶和走2阶输入两种不同的情况。所以，到达第n阶的所有情况为：dp[n]=dp[n-1]+dp[n-2]。