LeetCode198 House Robber
问题来源LeetCode198
问题描述
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 the police.
这道题的意思是设计一个不会触发警报的最大效益偷钱方案。警报触发的条件是两个连续的房屋被偷。
问题分析
这道题一开始我以为就是每隔一个房屋偷一次,就好了啊。后来意识到自己还是太想当然了。跟爬楼梯很像,也算是一个动态规划的题目。
其实计算的过程可以用下图进行表示。
偷第4个房屋的时候,最大利润应该是前面的1,2两个房屋中的较大值。因为1,2两个房屋不可能同时偷,3和4也不能同时偷。
所以递推公式就如图所示。
这里需要注意的是,在完成计算后,返回值应该是dp数组的最后一个值和倒数第二个值两者的最大值,因为代表的是两种情况。
代码如下
public int rob(int[] nums) {
if(nums==null||nums.length<1) return 0;
int [] dp = new int[nums.length+3];
dp[0]=dp[1]=dp[2]=0;
for (int i = 0; i < nums.length; i++) {
dp[i+3]=Math.max(dp[i],dp[i+1])+nums[i];
}
return Math.max(dp[dp.length-1],dp[dp.length-2]);
}
LeetCode学习笔记持续更新
GitHub地址 https://github.com/yanqinghe/leetcode
CSDN博客地址 http://blog.csdn.net/yanqinghe123/article/category/7176678