leetcode Paint House II

There are a row of n houses, each house can be painted with one of the k colors. 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 k cost matrix. For example,costs[0][0] is the cost of painting house 0 with color 0; costs[1][2] is the cost of painting house 1 with color 2, and so on... Find the minimum cost to paint all houses.

Note:
All costs are positive integers.

Follow up:
Could you solve it in O(nk) runtime?

用两个数组分别存储索引j之前的最小值和索引j之后的最小值，这样只需求min（arr1[j],arr2[j]）即为粉刷当前房子所需的最小花费，代码：

public int minCostII(int[][] costs) {
     if(costs.length==0||costs[0].length==0) return 0;
    int[] min1=new int[costs[0].length];
    int[] min2=new int[costs[0].length];
    int len=costs[0].length;
    for(int i=1;i<costs.length;i++){
        min1[0]=Integer.MAX_VALUE;
        for(int j=1;j<len;j++){
            min1[j]=Math.min(min1[j-1],costs[i-1][j-1]);
        }
        min2[len-1]=Integer.MAX_VALUE;
        for(int j=len-2;j>=0;j--){
            min2[j]=Math.min(min2[j+1],costs[i-1][j+1]);
        }
        for(int j=0;j<len;j++){
            costs[i][j]+=Math.min(min1[j],min2[j]);
        }
    }
    int res=Integer.MAX_VALUE;
    for(int j=0;j<len;j++){
        res=Math.min(res,costs[costs.length-1][j]);
    }
    return res;
}