# 256. Paint House - Medium

### Problem:

```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.
```

### Solutions:

``````public class Solution {
public int minCost(int[][] costs) {
if (costs == null || costs.length == 0 || costs.length == 0) {
return 0;
}
int min = Integer.MAX_VALUE;
int[] c = new int;
int[] newc = new int;
for (int i = 0; i < costs.length; i ++) {
if (i == 0) {
c = costs[i];
c = costs[i];
c = costs[i];
}
else {
newc = Math.min(c, c) + costs[i];
newc = Math.min(c, c) + costs[i];
newc = Math.min(c, c) + costs[i];
for (int j = 0; j < 3; j ++) {
c[j] = newc[j];
}
}
min = Math.min(Math.min(c, c), c);
}
return min;
}
}
``````