递推公式: dp[i]=dp[i−1]+dp[i−2];dp[0]=1,dp[1]=1 d p [ i ] = d p [ i − 1 ] + d p [ i − 2 ] ; d p [ 0 ] = 1 , d p [ 1 ] = 1
class Solution {
public:
int climbStairs(int n) {
vector<int> dp;
dp.push_back(1);
dp.push_back(1);
for(int i=2;i<=n;i++)
{
dp.push_back(dp[i-1]+dp[i-2]);
}
return dp[n];
}
};