class Solution {
public:
int dp[10005];
int climbStairs(int n) {
dp[1]=1;
dp[2]=2;
for(int i=3;i<=n;i++)
{
dp[i]=dp[i-1]+dp[i-2];
}
return dp[n];
}
};
转载于:https://www.cnblogs.com/dacc123/p/11567696.html