Title: House Robber Source: leetcode.com
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.
Java solution
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 |
/* https://leetcode.com/problems/house-robber/ */ import java.util.HashMap; class HouseRobber { /*int[] cache; public int rob(int[] num) { cache = new int[num.length]; for(int i=0;i<num.length;i++) { cache[i] = -1; } return helper(num, 0); } public int helper(int[] num, int i) { if(i>num.length-1) return 0; if(cache[i]!=-1) return cache[i]; return cache[i] = Math.max(num[i] + helper(num, i+2), helper(num, i+1)); }*/ public static void main(String args[]) { int[] nums = {10, 20, 11}; HouseRobber solution = new HouseRobber(); System.out.println(solution.rob(nums)); } public int rob(int[] nums) { int[] dp = new int[nums.length]; dp[0] = nums[0]; dp[1] = Math.max(nums[0], nums[1]); for(int i=2;i<nums.length;i++) { dp[i] = nums[i]+dp[i-2] > dp[i-1]? nums[i] + dp[i-2] : dp[i-1]; } return dp[nums.length-1]; } } |