1911. Maximum Alternating Subsequence Sum
On This Page
class Solution:
def maxAlternatingSum(self, nums: List[int]) -> int:
f = g = 0
for x in nums:
f, g = max(g - x, f), max(f + x, g)
return max(f, g)
class Solution:
def maxAlternatingSum(self, nums: List[int]) -> int:
f = g = 0
for x in nums:
f, g = max(g - x, f), max(f + x, g)
return max(f, g)