Time: 52 ms (30.28%) | Memory: 16.5 MB (15.45%) - LeetSync

Author: mrprashantkumar

maximum-ascending-subarray-sum/maximum-ascending-subarray-sum.py

@@ -0,0 +1,15 @@
+class Solution:
+    def maxAscendingSum(self, nums: List[int]) -> int:
+        ans = 0
+        seen = []
+        curr = 0
+        for i in nums:
+            if not seen or seen[-1] < i:
+                seen.append(i)
+                curr += i
+            else:
+                seen = [i]
+                ans = max(ans, curr)
+                curr = i
+        ans = max(ans, curr)
+        return ans