256.md

256 粉刷房子

Solution 1

每一种颜色只能由另外两种颜色转换而成.

class Solution {
    public int minCost(int[][] costs) {
        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], dp[i - 1][2]) + costs[i][0];
            dp[i][1] = Math.min(dp[i - 1][0], dp[i - 1][2]) + costs[i][1];
            dp[i][2] = Math.min(dp[i - 1][0], dp[i - 1][1]) + costs[i][2];
        }

        int result = Integer.MAX_VALUE;

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

        return result;
    }
}