Leetcode Paint House

来源：互联网发布：t-sql语法基础知识编辑：程序博客网时间：2024/04/30 10:34

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.

Difficulty: Medium

Solution: DP. Find the best solution with different color from the previous house.

public class Solution {        public int minCost(int[][] costs) {        int len = costs.length;        if(len == 0)            return 0;        for(int i = 1; i < len; i++){            for(int j = 0; j < costs[0].length; j++){                int min = Integer.MAX_VALUE;                for(int k = 0; k < costs[0].length; k++){                    if(k == j)                        continue;                    min = Math.min(min, costs[i-1][k]);                }                costs[i][j] += min;            }        }        return Math.min(Math.min(costs[len - 1][0], costs[len - 1][1]), costs[len - 1][2]);    }}

0 0