[leetcode] House Robber python 解决方案

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.

class Solution:
    # @param num, a list of integer
    # @return an integer
    def rob(self, num):
        total0,total1 = 0,0
        for item in num:
            total0,total1 = max(total0,total1), total0+item  #这样的好处很明显
        return max(total1,total0)

[leetcode] House Robber python 解决方案

原文：http://www.cnblogs.com/shyustc/p/4418752.html