这道LeetCode题目要求在给定不同成本的情况下，找到染色所有房子的最低总成本，且相邻房子颜色不能相同。通过动态规划策略，用三个状态分别表示每个房子染红、蓝、绿三种颜色的最小成本，通过比较前一个房子不同颜色的成本来更新当前房子的状态，得到动态转移方程。最后得出的代码实现了这一逻辑。
题目链接:https://leetcode.com/problems/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.
最低0.47元/天 解锁文章
1576
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
