方法一:动态规划
思路:状态转移方程为dp[i][j]=min(dp[i][j],dp[i-1][k]+costs[i][j]);
其中
(
j
≠
k
)
(j≠k)
(j=k)
class Solution {
public:
int minCost(vector<vector<int>>& costs) {
int n = costs.size();
if (!n) return 0;
vector<vector<int>> dp(n, vector<int>(3, INT_MAX));
for (int i = 0; i < n; ++i)
for (int j = 0; j < 3; ++j) {
if (i - 1 == -1) {//初始化
dp[i][j] = costs[i][j];
continue;
}
for (int k = 0; k < 3; ++k)
if (j != k) dp[i][j] = min(dp[i][j], dp[i - 1][k] + costs[i][j]);//状态转移方程
}
return min(dp[n - 1][0], min(dp[n - 1][1], dp[n - 1][2]));
}
};
方法二:动态规划(滚动数组优化)
思路:状态 dp[i][j]
只受 dp[i-1][k]
的影响,可使用滚动数组进行优化
class Solution {
public:
int minCost(vector<vector<int>>& costs) {
int n = costs.size();
if (!n) return 0;
vector<vector<int>> dp(2, vector<int>(3, INT_MAX));
for (int i = 0; i < n; ++i)
for (int j = 0; j < 3; ++j) {
if (i - 1 == -1) {//初始化
dp[i][j] = costs[i][j];
continue;
}
dp[i & 1][j] = INT_MAX;
for (int k = 0; k < 3; ++k)
if (j != k) dp[i & 1][j] = min(dp[i & 1][j],
dp[!(i & 1)][k] + costs[i][j]);//状态转移方程
}
return min(dp[(n - 1) & 1][0], min(dp[(n - 1) & 1][1], dp[(n - 1) & 1][2]));
}
};