public class Solution {
public int minCost(int[][] costs) {
if(costs.length==0||costs==null) return 0;
for(int i=1;i<costs.length;i++){
costs[i][0]+=Math.min(costs[i-1][1],costs[i-1][2]);
costs[i][1]+=Math.min(costs[i-1][0],costs[i-1][2]);
costs[i][2]+=Math.min(costs[i-1][1],costs[i-1][0]);
}
int n=costs.length-1;
return Math.min(Math.min(costs[n][0],costs[n][1]),costs[n][2]);
}
}
[LeetCode] Paint House 256. Paint House I 根据题意我们知道，粉刷第i栋房...
There are a row ofnhouses, each house can be painted with...
2021.2.7 Once there was a house with beautiful paint and ...
leetcode 265 Paint House II problem: There are a row of n...
https://leetcode.com/problems/paint-house/description/ 状态...
题目There are a row of n houses, each house can be painted ...
There are a row of n houses, each house can be painted wi...
There are a row of n houses, each house can be painted wi...
My code: 看到这道题目，我第一个想到的是** backtracking + memory cache **...
本文标题：256. Paint House
本文链接：https://www.haomeiwen.com/subject/ujnwmttx.html
网友评论