-
-
Notifications
You must be signed in to change notification settings - Fork 300
/
256.cpp
29 lines (29 loc) · 1.18 KB
/
256.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
__________________________________________________________________________________________________
class Solution {
public:
int minCost(vector<vector<int>>& costs) {
if (costs.empty() || costs[0].empty()) return 0;
vector<vector<int>> dp = costs;
for (int i = 1; i < dp.size(); ++i) {
for (int j = 0; j < 3; ++j) {
dp[i][j] += min(dp[i - 1][(j + 1) % 3], dp[i - 1][(j + 2) % 3]);
}
}
return min(min(dp.back()[0], dp.back()[1]), dp.back()[2]);
}
};
__________________________________________________________________________________________________
class Solution {
public:
int minCost(vector<vector<int>>& costs) {
if (costs.empty() || costs[0].empty()) return 0;
vector<vector<int>> dp = costs;
for (int i = 1; i < dp.size(); ++i) {
dp[i][0] += min(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] += min(dp[i - 1][0], dp[i - 1][2]);
dp[i][2] += min(dp[i - 1][0], dp[i - 1][1]);
}
return min(min(dp.back()[0], dp.back()[1]), dp.back()[2]);
}
};
__________________________________________________________________________________________________