zoukankan      html  css  js  c++  java
  • Paint House

    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.

    Note:
    All costs are positive integers.

     1 public class Solution {
     2     public int minCost(int[][] costs) {
     3         int n = costs.length;
     4         if (n == 0 || costs[0].length == 0) return 0;
     5         
     6         for (int i = 1; i < n; i++) {
     7             costs[i][0] += Math.min(costs[i - 1][1], costs[i - 1][2]);
     8             costs[i][1] += Math.min(costs[i - 1][0], costs[i - 1][2]);
     9             costs[i][2] += Math.min(costs[i - 1][0], costs[i - 1][1]);
    10         }
    11         
    12         return Math.min(costs[n - 1][0], Math.min(costs[n - 1][1], costs[n - 1][2]));
    13     }
    14 }
  • 相关阅读:
    dfssvc.exe
    我左边的公告
    再做了一个LOGO
    做一个调查,请大家帮忙
    如果年三十没有人陪我
    我喜欢这个模版
    cisvc.exe是什么服务
    IIS与SQL服务器安全加固
    终于申请到了blogs
    重发LOGO
  • 原文地址:https://www.cnblogs.com/amazingzoe/p/6391372.html
Copyright © 2011-2022 走看看