Problem Description
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 systems connected and it will automatically contact the police if two adjacent houses were broken into on the same night.
Given an integer array nums representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police.
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
class Solution {
public int rob(int[] nums) {
if(nums.length == 1) return nums[0];
//To keep a track of max till ith position
int[] dp = new int[nums.length];
//Initialize max for 0th and 1st positions
dp[0] = nums[0];
dp[1] = Math.max(dp[0], nums[1]);
//Iterate through position >=2
for(int i=2; i<nums.length; i++){
//Possible sum if we include the current element. Then we can add dp[i-2] to this number.
int a = nums[i] + dp[i-2];
//If we do not take the current element, we can consider max sum till previous position which is dp[i-1]
int b = dp[i-1];
//Take maximum between the above two possibilities
dp[i] = Math.max(a, b);
}
//The final maximum would be at the last position
return dp[dp.length-1];
}
}