方法一:
class Solution:
def massage(self, nums: List[int]) -> int:
last,now=0,0
for num in nums:
last,now=now,max(last+num,now)
return now
方法二:动态规划
class Solution:
def massage(self, nums: List[int]) -> int:
n = len(nums)
if n == 0:
return 0
dp0, dp1 = 0, nums[0]
for i in range(1,n):
tdp0 = max(dp0,dp1)
tdp1 = dp0 + nums[i]
dp0, dp1 = tdp0, tdp1
return max(dp0, dp1)