代码随想录第38天 509. 斐波那契数 class Solution { public: int fib(int n) { vector<int> dp(n+1,0); dp[0] = 0; if(n ==0){ return dp[n]; } dp[1] = 1; for(int i = 2;i <= n ; i++){ dp[i] = dp[i-1] + dp[i-2]; } int result = dp[n]; return result; } }; 70. 爬楼梯 class Solution { public: int climbStairs(int n) { if(n <=2) return n; vector<int> dp(n+1,0); int result; dp[1] = 1; dp[2] = 2; for(int i = 3; i <= n ; i++){ dp[i] = dp[i-1] + dp[i-2]; } result = dp[n]; return result; } }; 746. 使用最小花费爬楼梯 class Solution { public: int minCostClimbingStairs(vector<int>& cost) { int result; int n = cost.size(); vector<int> dp(n+1);//花费 dp[0] = 0; dp[1] = 0; for(int i =2; i <= n ; i++){ dp[i] = min(dp[i-1]+cost[i-1],dp[i-2]+cost[i-2]); } result = dp[n]; return result; } };