70. Climbing Stairs

dp[i]:到达第i层需要的步数，dp[i]=dp[i-1]+dp[i-2].

我犯得两个错误，1.dp[i]=dp[i-1]+1+dp[i-2]+1  2.只求到dp[0],dp[1]就开始循环

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