There are a row ofnhouses, each house can be painted with one of thekcolors. 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 anxkcost matrix. For example,costs[0][0]is the cost of painting house 0 with color 0;costs[1][2]is the cost of painting house 1 with color 2, and so on... Find the minimum cost to paint all houses.
Note:?All costs are positive integers.
第i 個房子要選costs[i][ x ] 顏色成本最小的哪一個账阻， 如果這個顏色與i-1 得到的結(jié)果顏色一直那么就不能選這個顏色， 繼續(xù)找成本第二小的顏色。 這樣一直算到最后一個药薯。
min1 ? min2 ?當(dāng)前第一小鸟悴， 第二小掏击。?
preMin1 preMin2 前一個第一小棍厌，第二小盆繁。
