-
Notifications
You must be signed in to change notification settings - Fork 4
/
HouseRobber.java
74 lines (67 loc) · 2.06 KB
/
HouseRobber.java
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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
package algorithms;
import org.junit.Test;
import java.util.Arrays;
import static org.junit.Assert.*;
/**
* 198. House Robber
* https://leetcode.com/problems/house-robber/
* Difficulty : Medium
* Related Topics : Array, Dynamic Programming
*
* 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.
*
* Example 1:
*
* Input: nums = [1,2,3,1]
* Output: 4
* Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).
* Total amount you can rob = 1 + 3 = 4.
* Example 2:
*
* Input: nums = [2,7,9,3,1]
* Output: 12
* Explanation: Rob house 1 (money = 2), rob house 3 (money = 9) and rob house 5 (money = 1).
* Total amount you can rob = 2 + 9 + 1 = 12.
*
* Constraints:
*
* 1 <= nums.length <= 100
* 0 <= nums[i] <= 400
*
* created by Cenk Canarslan on 2022-07-12
*/
public class HouseRobber {
@Test
public void testHouseRobber() {
assertEquals(4, rob(new int[]{1, 2, 3, 1}));
assertEquals(12, rob(new int[]{2, 7, 9, 3, 1}));
}
/**
*
* Runtime: 0 ms, faster than 100.00% of Java online submissions for House Robber.
* Memory Usage: 41.8 MB, less than 24.24% of Java online submissions for House Robber.
*
* @param nums
* @return
*/
public int rob(int[] nums) {
if (nums.length == 0) {
return 0;
}
int[] dp = new int[nums.length + 1];
dp[0] = 0;
dp[1] = nums[0];
for (int i = 1; i < nums.length; i++) {
dp[i + 1] = Math.max(dp[i], dp[i-1] + nums[i]);
}
System.out.println("dp[] = " + Arrays.toString(dp));
return dp[nums.length];
}
}