【LeeCode】 Paint House I and II

最新推荐文章于 2020-05-22 18:24:46 发布

shan0288

最新推荐文章于 2020-05-22 18:24:46 发布

阅读量142

点赞数

分类专栏：算法文章标签： Leecode——Paint House

本文链接：https://blog.csdn.net/shan0288/article/details/90370712

版权

本文探讨了LeetCode上的两道题目：Paint House I和Paint House II。在这些问题中，你需要给一排房子涂色，确保相邻的房子颜色不同。每个房子涂成不同颜色的费用由一个矩阵给出。目标是找到最小的总成本来涂色所有房子。请注意，所有成本都是正整数。

摘要由CSDN通过智能技术生成

Paint House I

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 houses with a certain color is represented by a n * 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.

public int paintHouseI(int[][] costs){
     if(costs==null||costs.length==0) return 0;
     int n = costs.length;
     for(int i=1;i<n;i++){
        costs[i][0] = Math.min(costs[i-1][1], costs[i-1][2]);
        costs[i][1] = Math.mi