两题都是基础dp题
#include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
int climbStairs(int n) {
if (n == 1)return 1;
if (n == 2)return 2;
vector<int>dp(n + 1);
dp[1] = 1; dp[2] = 2;
for (int i = 3; i <=n; i++) {
dp[i] = dp[i - 1] + dp[i - 2];
}
return dp[n];
}
};
int main(){
Solution test;
cout << test.climbStairs(3);
}
746最小花费爬楼梯
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
class Solution {
public:
int minCostClimbingStairs(vector<int>& cost) {
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]);
}
return dp[n];
}
};
int main(){
Solution test;
vector<int>cost = { 1,100,1,1,1,100,1,1,100,1 };
cout << test.minCostClimbingStairs(cost);
}