[leetcode] 256. Paint House @ python

原题

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.

Example:

Input: [[17,2,17],[16,16,5],[14,3,19]]
Output: 10
Explanation: Paint house 0 into blue, paint house 1 into green, paint house 2 into blue.
Minimum cost: 2 + 5 + 3 = 10.

解法1

动态规划, 使用red, blue, green表示当前位置的最小花费, 遍历costs, 状态转移方程为:

red = min(blue, green) + r
blue = min(red, green) + b
green = min(ren, blue) + g

注意三个变量需要同时更新.
Time: O(n)
Space: O(1)

代码

class Solution:
    def minCost(self, costs: 'List[List[int]]') -> 'int':
        red, blue, green = 0, 0, 0
        for r, b, g in costs:
            red, blue, green = min(blue, green) + r, min(red, green) + b, min(red, blue) + g            
            
        return min(red, blue, green)

解法2

解法1的泛化版. base case是当costs为空时, 返回0, 定义dp表示当前的最小代价, 遍历costs, 状态转移方程:

dp[j] = costs[i][j] + min(pre[:j] + pre[j+1:])

意思是, dp[j] = 这一步颜色取j的成本 + 上一步颜色不取j的成本的最小值

代码

class Solution:
    def minCost(self, costs: 'List[List[int]]') -> 'int':
        # base case
        if not costs: return 0
        
        dp = costs[0][:]
        for i in range(1, len(costs)):
            # get the previous minimum cost
            pre = dp[:]
            for j in range(len(costs[0])):
                dp[j] = costs[i][j] + min(pre[:j] + pre[j+1:])
                
        return min(dp)