Java for LeetCode 198 House Robber
2015-06-07 09:41
585 查看
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security system connected and it will automatically contact the police if two adjacent houses were broken into on the same night.
Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight without alerting
解题思路:
dp问题 dp[i]=nums[i]+Math.max(dp[i-2], dp[i-3])
JAVA实现如下:
Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight without alerting
解题思路:
dp问题 dp[i]=nums[i]+Math.max(dp[i-2], dp[i-3])
JAVA实现如下:
public int rob(int[] nums) { if(nums==null||nums.length==0) return 0; if(nums.length<=2) return Math.max(nums[0], nums[nums.length-1]); int[] dp=new int[nums.length]; dp[0]=nums[0]; dp[1]=nums[1]; dp[2]=nums[0]+nums[2]; for(int i=3;i<nums.length;i++) dp[i]=nums[i]+Math.max(dp[i-2], dp[i-3]); return Math.max(dp[nums.length-1], dp[nums.length-2]); }
相关文章推荐
- java 抽象类与接口的异同
- Java多线程<1>
- JAVA开发读取文件的方法
- Java创建Servlet找不到javax.servlet.*解决方案解决创建servlet 找不到webservlet包
- java生成随机数的两种方式
- java生成随机数的两种方式
- java中单例设计模式的两种实现方式
- Java 对象序列化和操作文件 正则表达式
- Java Web 第一篇 web应用和web.xml文件
- java多线程(一)基础概念
- java-IO流(下)
- Spring学习笔记 IOC原理实现
- Java学习--知识点1--static关键字
- Java使用反射来获取成员变量泛型信息
- eclipse快捷键
- Java面向对象小记(3)
- Struts2中的Action和ActionSupport
- 为eclipse离线安装hibernate tools插件
- Java排序算法
- spring4+websocket(兼容低版本ie)