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.
Credits:
Special thanks to @ifanchu for adding this problem and creating all test cases. Also thanks to @ts for adding additional test cases.
Subscribe to see which companies asked this question
采用动态递归思想，创建一个结果数组ｒｅｓ，每个下标ｉ取到的最大值是：
Math.max(res[i-2] + nums[i], res[i-1])
按照这个递推公式，ｒｅｓ[res.length-1] 即为所求．
1 public class Solution { 2 public int rob(int[] nums) { 3 if(null == nums || nums.length == 0) return 0; 4 if(nums.length == 1) return nums[0]; 5 //if(nums.length == 2) return nums[0] > nums[1] ? nums[0] : nums[1]; 6 int[] res = new int[nums.length]; 7 8 res[0] = nums[0]; 9 res[1] = Math.max(nums[0] , nums[1]); 10 for(int i = 2;i < res.length; i++){ 11 res[i] = Math.max(res[i-2]+nums[i],res[i-1]); 12 } 13 return res[res.length-1]; 14 } 15 }