From d0df9b92ca566fa3a4cbfb6b47223062e153014b Mon Sep 17 00:00:00 2001
From: bumpsoo <bumpsoo063@protonmail.ch>
Date: Tue, 4 Feb 2025 22:47:02 +0900
Subject: [PATCH] https://leetcode.com/problems/maximum-ascending-subarray-sum

---
 easy/maximum_ascending_subarray_sum.py | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)
 create mode 100644 easy/maximum_ascending_subarray_sum.py

diff --git a/easy/maximum_ascending_subarray_sum.py b/easy/maximum_ascending_subarray_sum.py
new file mode 100644
index 0000000..ebe874b
--- /dev/null
+++ b/easy/maximum_ascending_subarray_sum.py
@@ -0,0 +1,16 @@
+# https://leetcode.com/problems/maximum-ascending-subarray-sum
+
+from typing import List
+
+class Solution:
+    def maxAscendingSum(self, nums: List[int]) -> int:
+        result = 0
+        curr = nums[0]
+        for i in range(1, len(nums)):
+            if nums[i - 1] >= nums[i]:
+                result = max(result, curr)
+                curr = 0
+            curr += nums[i]
+        result = max(result, curr)
+        return result
+