# LeetCode House Robber

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 system connected and it will automatically contact the police if two adjacent houses were broken into on the same night.

Solution:

dp[i][0]表示第i个房子没有偷的最大值，dp[i][1]表示第i个房子偷了的最大值。

dp[i][0] = max( dp[i-1][0], dp[i-1][1] )

dp[i][1] = dp[i-1][0] + nums[i]

import java.util.*;

public class Solution {
public int rob(int[] nums) {
int n = nums.length;
if (n == 0)
return 0;
int dp[][] = new int[n][2];
dp[0][0] = 0;
dp[0][1] = nums[0];

for (int i = 1; i < n; i++) {
dp[i][0] = Math.max(dp[i - 1][0], dp[i - 1][1]);
dp[i][1] = dp[i - 1][0] + nums[i];
}

return Math.max(dp[n - 1][0], dp[n - 1][1]);
}
}

#### leetCode198-House Robber

2015-04-01 18:28:58

#### Leetcode 198: House Robber

2015-04-01 02:51:09

#### leetcode 213 : House Robber II

2015-05-21 07:36:47

#### [leetcode-337]House Robber III(java)

2016-03-27 22:19:41

#### LeetCode213:House Robber II

2015-06-13 11:14:36

#### 198. House Robber [easy] (Python)

2016-06-01 14:39:22

#### [leetcode] 337. House Robber III

2016-03-12 20:20:56

#### Leetcode_198_House Robber

2015-08-15 12:02:28

#### leetcode 337. House Robber III-动态规划|Java|Python简洁高效

2016-03-13 21:06:45

#### leetcode 198 House Robber C++

2016-05-28 19:45:09