zoukankan      html  css  js  c++  java
  • [LC] 198. House Robber

    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.

    Example 1:

    Input: [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 2:

    Input: [2,7,9,3,1]
    Output: 12
    Explanation: Rob house 1 (money = 2), rob house 3 (money = 9) and rob house 5 (money = 1).
                 Total amount you can rob = 2 + 9 + 1 = 12.

    Solution 1:
    Time: O(N)
    Space: O(N)
    class Solution:
        def rob(self, nums: List[int]) -> int:
            if not nums:
                return 0
            if len(nums) <= 2:
                return max(nums)
    
            max_lst = [0] * len(nums)
            max_lst[0] = nums[0]
            max_lst[1] = max(nums[0], nums[1])
            for i in range(2, len(nums)):
                max_lst[i] = max(max_lst[i - 1], max_lst[i - 2] + nums[i])
            return max_lst[-1]

    Solution 2:

    Time: O(N)

    Space: O(1)

    class Solution:
        def rob(self, nums: List[int]) -> int:
            if not nums:
                return 0
            prev_prev, prev, cur = 0, 0, 0
            for num in nums:
                prev_prev = prev
                prev = cur
                cur = max(num + prev_prev, prev)
            return cur
  • 相关阅读:
    React.memo()使用教程
    React组件什么时候render
    redux-thunk使用教程
    Redux数据持久化
    Mac 中安装 nvm: 切换Node 不同版本
    上传文件类型选择
    Python获取软件安装列表
    Java读取text文件
    负载均衡
    远程调用
  • 原文地址:https://www.cnblogs.com/xuanlu/p/11746963.html
Copyright © 2011-2022 走看看