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

题目的意思是不能取相邻两个房子里的钱，最少要格一个取。

要在O（N）的时间内完成，需要不断的判断与舍弃。

从头到尾查看数组，设sum1是查看到奇数号房间时已经取到的所有钱，设sum2是查看到偶数号房间时已经取到的所有钱。

假设本次查看的房间为奇数，此时的sum1仍为上一个奇数号房间时所取得的所有钱，sum2则是查看到前一个房间时取到的所有钱，那么我们很容易知道，判断当前情况下是否要取这个i号房间里的钱，只需要判断（sum1+nums[i]）与sum2谁比较大即可。如果判断结果是sum1在取了本房间里的钱之后还不如sum2大，那本房间里的钱就没有必要取，到本房间为止取得的最多钱数等于sum2。反之，就让sum1加上本房间里的钱，目前为止取得的最多的钱数为sum1.

如果查看到本房间号为偶数的话，和上面的操作是一样的。