[Lintcode] Paint House II whitewashed houses two

There is a row of n houses, each house can is painted with one of the K colors. The cost of painting a certain color is different. You had to paint all the houses such, that no, and adjacent houses have the same color.

The cost of painting a certain color are represented by a n x K cost matrix. For example, costs[0][0] are 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.

Notice

All costs is positive integers.

Example
Given n = 3, k = 3, costs = [[14,2,11],[11,14,5],[14,3,10]] return 10

House 0 was color 2, House 1 was Color 3, House 2 is color 2, 2 + 5 + 3 = 10

[Lintcode] Paint House II whitewashed houses two