Patin House II | Leetcode

There are a row of n houses, each house can be painted with one of the k colors. 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 k cost 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.

Follow up:
Could you solve it in O(nk) runtime?

思路：

背包问题，一个相对较弱的思路, dp[i][j] 代表用颜色j刷房子i的最小花费（假设只有i个房子）

O(K*K*N) 

 代码如下:

class Solution {
public:
    int minCostII(vector<vector<int>>& costs) {
        if (costs.empty())
            return 0;
        int houses = costs.size();
        int colors = costs[0].size();
        //init
        vector<vector<int>> dp(houses,vector<int>(colors,INT_MAX));
        for (int i = 0; i < colors; i++)
            dp[0][i] = costs[0][i];
        //start dp
        for (int i = 1; i < houses; i++) {
            for (int j = 0; j < colors; j++) {
                for (int k = 0; k < colors; k++) {
                    if (k == j)
                        continue;
                    dp[i][j] = min(dp[i][j],dp[i-1][k]+costs[i][j]);
                }
            }
        }
        
        int result = INT_MAX;
        for (int j = 0; j < colors; j++) {
            result = min(result,dp[houses-1][j]);
        }
        return result;
    }
};