[leetcode] 213. House Robber II

本文主要是介绍[leetcode] 213. House Robber II，对大家解决编程问题具有一定的参考价值，需要的程序猿们随着小编来一起学习吧！

题目

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have a security system connected, and it will automatically contact the police if two adjacent houses were broken into on the same night.

Given an integer array nums representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police.

Example 1:

Input: nums = [2,3,2]
Output: 3
Explanation: You cannot rob house 1 (money = 2) and then rob house 3 (money = 2), because they are adjacent houses.

Example 2:

Input: nums = [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 3:

Input: nums = [1,2,3]
Output: 3

Constraints:

• 1 <= nums.length <= 100
• 0 <= nums[i] <= 1000

思路

序列删掉第一个或最后一个元素后分别执行一次rob。

代码

python版本：

class Solution:
    def rob(self, nums: List[int]) -> int:
        def calc(nums):
            max_nums = [0 for _ in range(len(nums))]
            max_nums[0] = nums[0]
            max_nums[1] = max(nums[0], nums[1])
            for i in range(2, len(max_nums)):
                max_nums[i] = max(max_nums[i-1], max_nums[i-2]+nums[i])
            return max_nums[-1]

        if len(nums) == 1:
            return nums[0]
        if len(nums) == 2:
            return max(nums)
        return max(calc(nums[1:]), calc(nums[:-1]))

这篇关于[leetcode] 213. House Robber II的文章就介绍到这儿，希望我们推荐的文章对大家有所帮助，也希望大家多多支持为之网！