-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathHouseRobber.java
More file actions
36 lines (29 loc) · 1.39 KB
/
Copy pathHouseRobber.java
File metadata and controls
36 lines (29 loc) · 1.39 KB
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
// 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.
// See: https://leetcode.com/problems/house-robber/
package leetcode.dynamic_programming;
public class HouseRobber {
public int rob(int[] nums) {
if (nums.length == 0)
return 0;
if (nums.length == 1)
return nums[0];
int[] dp = new int[nums.length + 1];
dp[1] = nums[0];
for (int i = 2; i < dp.length; i++)
dp[i] = Math.max(dp[i - 2] + nums[i - 1], dp[i - 1]);
return dp[dp.length - 1];
}
public static void main(String[] args) {
HouseRobber sln = new HouseRobber();
System.out.println(sln.rob(new int[] { 1, 2, 3, 1 }));
System.out.println(sln.rob(new int[] { 2, 7, 9, 3, 1 }));
System.out.println(sln.rob(new int[] { 1, 2 }));
System.out.println(sln.rob(new int[] { 2, 1 }));
System.out.println(sln.rob(new int[] { 2, 1, 1, 2 }));
}
}