There are a row of n houses, each house can be painted with one of the three colors: red, blue or green. The cost of painting each house with a certain color is different. You have to paint all the houses such that no two adjacent houses have the same color.
The cost of painting each house with a certain color is represented by a n
x3
cost matrix. For example, costs[0][0]
is the cost of painting house 0
with color red; costs[1][2]
is the cost of painting house 1
with color green, and so on... Find the minimum cost to paint all houses.
Notice
All costs are positive integers.
Given costs
= [[14,2,11],[11,14,5],[14,3,10]]
return 10
house 0 is blue, house 1 is green, house 2 is blue, 2 + 5 + 3 = 10
class Solution {
public:
/**
* @param costs n x 3 cost matrix
* @return an integer, the minimum cost to paint all houses
*/
int minCost(vector<vector<int>>& costs) {
// Write your code here
if (costs.size() == 0) //检查边界条件非常重要
return 0;
int n = costs.size();
vector<vector<int>> dp(n, vector<int>(3));
//dp[i][j] 表示计算到第i户时,他选择第j种颜色图墙时的最小价钱
for (int i=0; i<3; i++)
{
dp[0][i] = costs[0][i];
}
for (int i=1; i<n; i++)
{
for (int j=0; j<3; j++)
{
int minC = INT_MAX;
for (int k=0; k<3; k++)
{
if (k != j)
{
minC = min(minC, dp[i-1][k]);
}
dp[i][j] = minC + costs[i][j];
}
}
}
int minRet = INT_MAX;
for (int i=0; i<3; i++)
{
minRet = min(minRet, dp[n-1][i]);
}
return minRet;
}
};