zoukankan      html  css  js  c++  java
  • leetcode_198. 打家劫舍

    超出时间限制
    class Solution:
        def rob(self, nums: List[int]) -> int:
            if not nums:
                return 0
            if len(nums)==1:
                return nums[0]
            if len(nums)==2:
                return max(nums[0],nums[1])
            for i in range(2,len(nums)):
                return max(nums[0]+self.rob(nums[2:]),self.rob(nums[1:]))
    
    class Solution:
        def rob(self, nums: List[int]) -> int:
            if not nums:
                return 0
            if len(nums)==1:
                return nums[0]
            ls=[]
            ls.append(nums[0])
            ls.append(max(nums[0],nums[1]))
            for i in range(2,len(nums)):
                ls.append(max(ls[i-1],nums[i]+ls[i-2]))
            return ls[len(ls)-1]
    
  • 相关阅读:
    053-242
    053-227
    053-671
    053-489
    053-670
    sql
    白纸黑字签字画押,出人命的事
    CSS
    JS
    Eclipse发布地址不同引发的问题
  • 原文地址:https://www.cnblogs.com/hqzxwm/p/14138244.html
Copyright © 2011-2022 走看看