leetcode256.粉刷房子(java)：动态规划

题目

示例

思路

1. 二维动态规划
   因为相邻房子不能同颜色，所以dp[i][0]只能从dp[i-1][1]和dp[i-1][2]变化来，dp[i][1]，dp[i][2]以此类推。

dp[i][0] = Math.min(dp[i-1][1]+costs[i][0],dp[i-1][2]+costs[i][0]);
            dp[i][1] = Math.min(dp[i-1][0]+costs[i][1],dp[i-1][2]+costs[i][1]);
            dp[i][2] = Math.min(dp[i-1][0]+costs[i][2],dp[i-1][1]+costs[i][2]);

2. 初始条件

dp[0][0] = costs[0][0];
        dp[0][1] = costs[0][1];
        dp[0][2] = costs[0][2];

具体代码

class Solution {
    public int minCost(int[][] costs) {
        if(costs == null || costs.length == 0){
            return 0;
        }
        int dp[][] = new int[costs.length][3];
        dp[0][0] = costs[0][0];
        dp[0][1] = costs[0][1];
        dp[0][2] = costs[0][2];
        for(int i = 1;i < costs.length;i++){
            dp[i][0] = Math.min(dp[i-1][1]+costs[i][0],dp[i-1][2]+costs[i][0]);
            dp[i][1] = Math.min(dp[i-1][0]+costs[i][1],dp[i-1][2]+costs[i][1]);
            dp[i][2] = Math.min(dp[i-1][0]+costs[i][2],dp[i-1][1]+costs[i][2]);
        }
        return Math.min(dp[costs.length-1][0],Math.min(dp[costs.length-1][1],dp[costs.length-1][2]));
    }
}