【Leetcode】House Robber

【题目】

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.

Credits:
Special thanks to @ifanchu for adding this problem and creating all test cases. Also thanks to @ts for adding additional test cases.

【思路】

一度题目，，呵呵答，果然是我最怕的DP，而且还要考虑相邻的不能一起偷，那么每到一家就要判断是要偷还是不偷，偷得话，就要取上一家没被偷的记录，如果不偷的话就要从上一家被偷和没被偷的数据中，选出最大的那个值。

【代码】

public int rob(int[] num) {    int rob = 0; //max monney can get if rob current house    int notrob = 0; //max money can get if not rob current house    for(int i=0; i<num.length; i++) {        int currob = notrob + num[i]; //if rob current value, previous house must not be robbed        notrob = Math.max(notrob, rob); //if not rob ith house, take the max value of robbed (i-1)th house and not rob (i-1)th house        rob = currob;    }    return Math.max(rob, notrob);}