LeetCode 198.House Robber 解题分析

题目来源

https://leetcode.com/problems/house-robber/description/

题目描述

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.

题意分析

一排房子，每个房子里面有一定数量的钱，我们的任务是在不去相邻的房子的前提下得到最多的钱

题目思路

动态规划问题，这里采用自底向上的方法。先计算只有前两个房子钱数的最大值，然后计算只有前三个房子钱数的最大值……最后计算含有所有房子钱数的最大值。前面已解决的问题可以帮助解决现在的问题。设money[x]为能从0~x号房子得到钱数的最大值，house[y]为y号房子的钱数。要得到money[n]，我们有两种方式可选，选择money[n-2]+house[n]（形象地理解为去过n-2号房子，接着去n号房子），或者money[n-1]（理解为由于去过n-1号房子而不能再去n号房子了），那么money[n] = max(money[n-2] + house[n], money[n-1])。

实现代码（Python3）

class Solution:
    def rob(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if len(nums) == 0:
            return 0
        if len(nums) == 1:
            return nums[0]
        if len(nums) == 2:
            return max(nums)
        nums[1] = max(nums[0], nums[1])
        for i in range(2, len(nums)):
            nums[i] = max(nums[i-2]+nums[i], nums[i-1])
        return nums[-1]