Java for LeetCode 198 House Robber
浏览数：35 /
时间：2015年06月08日
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实现如下：
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]);
}
郑重声明：本站内容如果来自互联网及其他传播媒体，其版权均属原媒体及文章作者所有。转载目的在于传递更多信息及用于网络分享，并不代表本站赞同其观点和对其真实性负责，也不构成任何其他建议。
