Question

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.

简而言之，就是给定一个数组，我们取出一个最大的和，但是不能取相邻两个数组的值。

Solution

 1
 2
 3
 4
 5
 6
 7
 8
 9
10

class Solution:
    
    def rob(self, nums):
        
        last, now = 0, 0
        
        for i in nums: 
            last, now = now, max(last + i, now)
                
        return now

Experience

有时候想的太复杂也不好。。