[Swift]LeetCode256.粉刷房子 $ 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? Note: 有N排房子,每栋房子都可以涂上三种颜色中的一种:红色、蓝色或绿色。用某种颜色粉刷每栋房子的费用是不同的。你必须把所有的房子都漆成没有两个相邻的房子有相同的颜色。 用一个n x 3的成本矩阵表示每栋房子涂上某种颜色的成本。例如,? 注: 所有成本costs都是正整数。 1 class Solution { 2 func minCost(_ costs:[[Int]]) -> Int{ 3 if costs.isEmpty || costs[0].isEmpty 4 { 5 return 0 6 } 7 var dp:[[Int]] = costs 8 for i in 1..<dp.count 9 { 10 for j in 0..<3 11 { 12 dp[i][j] += min(dp[i - 1][(j + 1) % 3],dp[i - 1][(j + 2) % 3]) 13 } 14 } 15 return min(min(dp.last![0],dp.last![1]),dp.last![2]) 16 } 17 } (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |