leetcode-265-Paint House II

最新推荐文章于 2022-05-01 22:26:32 发布

zem_nezer

最新推荐文章于 2022-05-01 22:26:32 发布

阅读量150

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/zem_nezer/article/details/87217853

版权

算法专栏收录该内容

185 篇文章 0 订阅

订阅专栏

Error:
first I get the equation: dp[i][j] = min(dp[i - 1][k]) + cost[i][j] (k != j), but it needs O(n * k * k), which loop for all n and for each n loop for all previous k for each current k in the n.

So it come up with second equation: dp[i][j] = dp[i - 1][j] + min_cost (j != index of cost) || dp[i][j] = dp[i - 1][j] + min_sec_cost (j = index of cost). Which cost is the first and second minimum.