[LC] 256. Paint House
2024-09-05 08:57:28
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.
Example:
Input: [[17,2,17],[16,16,5],[14,3,19]]
Output: 10
Explanation: Paint house 0 into blue, paint house 1 into green, paint house 2 into blue.
Minimum cost: 2 + 5 + 3 = 10.
class Solution {
public int minCost(int[][] costs) {
if (costs == null || costs.length == 0 || costs[0].length == 0) {
return 0;
}
int curRed = costs[0][0];
int curBlue = costs[0][1];
int curGreen = costs[0][2];
int prevRed = curRed;
int prevBlue = curBlue;
int prevGreen = curGreen;
for (int i = 1; i < costs.length; i++) {
curRed = Math.min(prevBlue, prevGreen) + costs[i][0];
curBlue = Math.min(prevRed, prevGreen) + costs[i][1];
curGreen = Math.min(prevRed, prevBlue) + costs[i][2];
prevRed = curRed;
prevBlue = curBlue;
prevGreen = curGreen;
}
return Math.min(curRed, Math.min(curBlue, curGreen));
}
}
最新文章
- javascript-style-guide
- web前端基础知识-(七)Django进阶
- Zookeeper 初体验之——伪分布式安装(转)
- 实例化bean的三种方式
- 【转】理解JavaScript之闭包
- RHEL 6.1字符界面无法登录SSH却能登录
- CENTOS6.5 teamviewer安装
- mysql数据库优化[千万级查询]
- LeeCode-Two Sum
- 20151214--JSTL
- 基于FPGA的DW8051移植(三)
- jquery.ajax异步发送请求的简单测试
- 苹果新的编程语言 Swift 语言进阶(十三)--类型检查与类型嵌套
- GitHub的简单使用记录
- C++ 深入理解 虚继承、多重继承和直接继承
- maven(三):maven项目结构及其运行机制
- Java知多少(18)类的定义及其实例化
- Codeforces Round #526 (Div. 2) Solution
- C - Oil Deposits(dfs)
- c/c++ int,float,short 大小端转换函数