LintCode: 房屋染色 II

最新推荐文章于 2022-11-03 00:51:33 发布

zyaphone

最新推荐文章于 2022-11-03 00:51:33 发布

阅读量1.1k

点赞数

分类专栏： lintcode python

本文链接：https://blog.csdn.net/u012225151/article/details/52547043

版权

lintcode 同时被 2 个专栏收录

139 篇文章 0 订阅

订阅专栏

python

116 篇文章 0 订阅

订阅专栏

LintCode: 房屋染色 II

先用朴素的动态规划，状态转移方程
ans[i][j] = min(ans[i-1][j]+cost[i][k], ans[i][j])
89%时提示超时。

class Solution:
    # @param {int[][]} costs n x k cost matrix
    # @return {int} an integer, the minimum cost to paint all houses
    def minCostII(self, costs):
        # Write your code here
        if not costs:
            return 0
        n = len(costs)
        m = len(costs[0])
        ans = [[9999999 for i in range(m)] for i in range(2)]
        ans[0] = costs[0]
        for i in range(1, n):
            for j in range(m):
                for k in range(m):
                    if j != k:
                        ans[1][j] = min(ans[0][k] + costs[i][j], ans[1][j])           
            ans[0] = ans[1]
            ans[1] = [9999999 for i in range(m)]       
        return min(ans[0])