Buttercola: Leetcode: Paint House

Buttercola: Leetcode: Paint House

Leetcode: 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[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.

Understand the problem:
Here we can show a wrong solution first, using the greedy algorithm. That is, each house we choose the min cost as long as it is not the same color as the previous one. 

Read full article from Buttercola: Leetcode: Paint House