Python 的 LeetCode 之旅（2）：198. House Robbersss

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.

Example 1:

Input: [1,2,3,1]
Output: 4
Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).
             Total amount you can rob = 1 + 3 = 4.

Example 2:

Input: [2,7,9,3,1]
Output: 12
Explanation: Rob house 1 (money = 2), rob house 3 (money = 9) and rob house 5 (money = 1).
             Total amount you can rob = 2 + 9 + 1 = 12.

题目大意：

从一个数组中取出一系列数，要求这些数在数组中的位置不能相邻，求取出的数的和的可能的最大值

思路分析：

这是一道很简单的动态规划问题，只要了解前n个数的最大和为前n-1个数的最大和与前n-2个数的最大和加第n个数之中较大者就可以了。即:ans[n] = max{ans[n - 1],ans[n - 2] + num[n]}，代码如下：

class Solution(object):
    def rob(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        pre = 0;
        cur = 0;
        for num in nums:
            if pre + num < cur :
                pre = cur
            else :
                pre,cur = cur,(pre + num)
        return cur