Climbing Stairs 递推上台阶

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?

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