动态规划五步:
确定dp数组行列含义
递推公式
dp数组初始化
数组遍历顺序
(出错后)print dp数组。
class Solution {
public:
int fib(int n) {
if(n <= 1) return n;
int dp[] = {0, 1};
for(int i = 2; i <= n; i++) {
int sum = dp[0] + dp[1];
dp[0] = dp[1];
dp[1] = sum;
}
return dp[1];
}
};
class Solution {
public:
int climbStairs(int n) {
if(n <= 2) return n;
vector<int> dp = {1, 2};
for(int i = 2; i < n; i++) {
int temp = dp[0] + dp[1];
dp[0] = dp[1];
dp[1] = temp;
}
return dp[1];
}
};
class Solution {
public:
int minCostClimbingStairs(vector<int>& cost) {
vector<int> dp(cost.size() + 1, 0);
for(int i = 2; i <= cost.size(); i++) {
dp[i] = min(dp[i - 1] + cost[i - 1], dp[i - 2] + cost[i - 2]);
}
return dp[cost.size()];
}
};