*LeetCode-Paint House
来源:互联网 发布:cad不能访问到网络锁 编辑:程序博客网 时间:2024/05/16 09:23
backstracking和dp的时间复杂度!
这个题backstracking超时了 dp就省时间一些
每个格子是这个房子某种颜色 + min(截至上个房子另一种颜色,上一个房子第三种颜色)
public class Solution { public int minCost(int[][] costs) { if ( costs == null || costs.length == 0 ) return 0; int m = costs.length; int [][] res = new int [ m ][ 3 ]; res [0][0] = costs[0][0]; res [0][1] = costs[0][1]; res [0][2] = costs[0][2]; for ( int i = 1; i < m; i ++ ){ res [ i ][ 0 ] = Math.min( res[ i - 1 ][ 1 ], res[ i - 1 ][ 2 ] ) + costs[ i ][ 0 ]; res [ i ][ 1 ] = Math.min( res[ i - 1 ][ 0 ], res[ i - 1 ][ 2 ] ) + costs[ i ][ 1 ]; res [ i ][ 2 ] = Math.min( res[ i - 1 ][ 0 ], res[ i - 1 ][ 1 ] ) + costs[ i ][ 2 ]; } return Math.min( res[ m - 1 ][ 0 ], Math.min( res[ m - 1 ][ 1 ], res[ m - 1 ][ 2 ])); }}
省空间的方法是就直接用costs数组存这个matrix 但是不知道题意可不可以改变input
0 0
- Leetcode: Paint House
- Leetcode: Paint House II
- [Leetcode]Paint House
- [Leetcode]Paint House II
- *LeetCode-Paint House
- [LeetCode] Paint House
- [leetcode 256] Paint House
- [Leetcode 256]Paint House
- LeetCode 256. Paint House
- Leetcode Paint House
- leetcode Paint House II
- LeetCode 256. Paint House
- LeetCode 题解(258) : Paint House
- [Leetcode 265]Paint House II
- LeetCode 265. Paint House II
- Leetcode 265. Paint House II
- leetcode 265. Paint House II
- Leetcode 256. Paint House & 265. Paint House II
- 什么是Polymer?
- Longest Palindromic Substring O(N) solution
- HTTP协议超级详解
- activity大总结
- leetcode题目记录
- *LeetCode-Paint House
- 给那些认为Grunt奇怪又难懂的人看的Grunt教程
- LeetCode OJ 11 Container With Most Water
- 给那些认为Grunt奇怪又难懂的人看的Grunt教程(二)
- Grunt即学即用
- LeetCode OJ 12 Integer to Roman
- iOS超全学习资料
- Servlet学习笔记二(会话技术)
- intent.setclass的一个误解