题解 | #打家劫舍(二)#

#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
#
# @param nums int整型一维数组
# @return int整型
#
class Solution:
    def rob(self, nums: List[int]) -> int:
        # write code here
        m = len(nums)
        dp = [0] * (m + 1)
        dp1 = [0] * (m + 1)
        res1, res2 = 0, 0  # 偷第一家 和 偷最后一家最大的money
        dp[1] = nums[0]
        for i in range(2, m):
            dp[i] = max(dp[i - 2] + nums[i - 1], dp[i - 1])
        print(dp)
        res1 = dp[m - 1]

        dp1[1] = 0
        for j in range(2, m + 1):
            dp1[j] = max(dp1[j - 2] + nums[j - 1], dp1[j - 1])
        print(dp1)
        res2 = dp1[m]

        return res1 if res1 > res2 else res2