思路
递归:超时啦
代码
class Solution(object):
def massage(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
n = len(nums)
if n == 0:
return 0
if n == 1:
return nums[0]
if n == 2:
return max(nums[0], nums[1])
len1 = nums[n - 1] + self.massage(nums[:n - 2])
len2 = nums[n - 2] + self.massage(nums[:n - 3])
return max(len1, len2)
思路
动态规划
代码
class Solution(object):
def massage(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
last , now = 0,0
for num in nums:
last,now = now,max(now,last+num)
return now