[LeetCode] House Robber解題思路實作代碼1實作代碼2

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.

動态規劃

狀态轉移方程：f[i] =max(f[i-1], f[i-2]+c[i])

f[i]表示進入第i+1個房間時所得到的最大财富。

為了節省空間，隻是用三個變量prepre, pre, cur即可。