# [LeetCode256]Paint House

``````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 is the cost of painting house 0 with color red; costs 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.

Hide Company Tags LinkedIn
Hide Tags Dynamic Programming
Hide Similar Problems (E) House Robber (M) House Robber II (H) Paint House II (E) Paint Fence
``````

``````class Solution {
public:
int minCost(vector<vector<int>>& costs) {
if(costs.empty()) return 0;
int n = costs.size(), r = 0, g = 0, b = 0;
for(int i = 0; i<n; ++i){
int lastR = r, lastG = g, lastB = b;
r = costs[i] + min(lastG, lastB);
g = costs[i] + min(lastR, lastB);
b = costs[i] + min(lastR, lastG);
}
return min(r, min(g, b));
}
};``````