[LeetCode]--198. 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问题，用A[0]表示没有rob当前house的最大money，A[1]表示rob了当前house的最大money，那么A[0] 等于rob或者没有rob上一次house的最大值
即A[i+1][0] = max(A[i][0], A[i][1]).. 那么rob当前的house，只能等于上次没有rob的+money[i+1], 则A[i+1][1] = A[i][0]+money[i+1].
实际上只需要两个变量