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 x 3
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.
Note:
All costs are positive integers.
All costs are positive integers.
/*algorithm : dfs based brute force solution
*/
//red:0,blue:1,green:2 costs: nx3 matrix
void dfs(vector<vector<int> >&costs,int cur,int n,int cost,int &minCost,vector<int>&path){
if(cur == n){
minCost = min(minCost,cost);
return;
}
for(int i = 0;i < 3;i++){
if(cost >= minCost)break;
if(path.size() && i == path[path.size()-1])continue;
path.push_back(i);
dfs(costs,cur+1,n,cost+costs[cur][i],minCost,path);
path.pop_back();
}
}
int minCost(vector<vector<int> >& costs)
{
int n = costs.size();
vector<int>path;
int minCost = INT_MAX;
dfs(costs,0,n,0,minCost,path);
return minCost;
}
/*algorithm: dp soluton ,similar path sum problem
for path[0..i]
level i; dp[i][0] = min(dp[i-1][1],dp[i-1][2]) + dp[i][0];
dp[i][1] = min(dp[i-1][0],dp[i-1][2]) + dp[i][1]
dp[i][2] = min(dp[i-1][0],dp[i-1][1]) + dp[i][2]
time: O(n) space O(1)
the path min cost is min(dp[n-1][0...2])
*/
int minCost(vector<vector<int> >&costs){
int n = costs.size();
for(int i = 1;i < n;i++){
costs[i][0] += min(costs[i-1][1],costs[i-1][2]);
costs[i][1] += min(costs[i-1][0],costs[i-1][2]);
costs[i][2] += min(costs[i-1][0],costs[i-1][1]);
}
return min(costs[n-1][0],min(costs[n-1][1],costs[n-1][2]));
}