Runtime: 2571 ms (Top 53.06%) | Memory: 28.4 MB (Top 82.81%)

Author: AnasImloul

scripts/algorithms/M/Maximum Alternating Subsequence Sum/Maximum Alternating Subsequence Sum.py

@@ -1,3 +1,4 @@
+# Runtime: 2571 ms (Top 53.06%) | Memory: 28.4 MB (Top 82.81%)
 class Solution:
     def maxAlternatingSum(self, nums: List[int]) -> int:
         ans = 0
@@ -12,4 +13,4 @@ def maxAlternatingSum(self, nums: List[int]) -> int:
                 direction = 'down'
         if direction == 'up':
             return ans
-        return ans + nums[-1]
+        return ans + nums[-1]