题目:
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.
解题思路:
给定一个数组,取不相邻数字和最大的结果
动态规划: f(n) = max{f(n-1),f(n-2)+nums[n]}
代码:
立马就能想到的一种——空间复杂度是O(n)
class Solution {
public int rob(int[] nums) {
//动态规划来实现
//相邻的数字不能选择
//f(i) = max{f(i-1), f(i-2)+nums[i]}
if(nums==null || nums.length==0)
return 0;
if(nums.length==1)
return nums[0];
if(nums.length==2)
return Math.max(nums[0],nums[1]);
int[] D = new int[nums.length];
D[0] = nums[0];
D[1] = Math.max(nums[0],nums[1]);
for(int i=2;i<nums.length;i++){
D[i] = Math.max(D[i-1], D[i-2]+nums[i]);
}
return D[nums.length-1];
}
}
如果有要求是:空间复杂度是 O(1)
对当前位上的数字:一共有两种选择:
第一种: 不选择: 它的最大值就是上一个数字的最大值
第二种:选择: 它的最大值就是上一个数字不选择的结果+当前位上的数字
用一个temp来记录上一个数字的不选择的结果
class Solution {
public int rob(int[] nums) {
//动态规划来实现
//对于当前数字的两种选择
int sum1 = 0; //
int sum2 = 0;
for(int i=0;i<nums.length;i++){
int temp = sum1;
sum1 = Math.max(sum1, sum2); //当前位上的数字不选择,等于上一个数字选择的结果最大值
sum2 = temp+nums[i];//当前位上的数字选择,只能等于上一个数字没有选择的结果+当前位上的数字
}
return Math.max(sum1,sum2);
}
}