FilesExpand file tree

 master

/

houseRobber.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

33 lines (18 loc) · 1.12 KB

 master

/

houseRobber.java

Copy path

Top

File metadata and controls

• Code
• Blame

33 lines (18 loc) · 1.12 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

// 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.

public class Solution {

public int rob(int[] nums) {

if(nums.length == 0) return 0;

if(nums.length == 1) return nums[0];

int[] dp = new int[nums.length];

dp[0] = nums[0];

dp[1] = nums[0] > nums[1] ? nums[0] : nums[1];

for(int i = 2; i < nums.length; i++) {

dp[i] = Math.max(dp[i - 2] + nums[i], dp[i - 1]);

}

for(int i = 0; i < dp.length; i++) {

System.out.print(dp[i] + " ");

}

return dp[dp.length - 1];

}

}