Create 1800. Maximum ascending subarray sum

dishathakurata · Feb 5, 2025 · 9158c38 · 9158c38
1 parent cc79eef
commit 9158c38
Showing 1 changed file with 14 additions and 0 deletions.
diff --git a/1800. Maximum ascending subarray sum b/1800. Maximum ascending subarray sum
@@ -0,0 +1,14 @@
+//1800. Maximum ascending subarray sum
+
+class Solution {
+    public int maxAscendingSum(int[] nums) {
+        int curr = nums[0], ans = nums[0];
+
+        for(int i = 1; i < nums.length; i++) {
+            curr = nums[i] > nums[i - 1] ? curr + nums[i] : nums[i];
+            ans = Math.max(ans, curr);
+        }
+
+        return ans;
+    }
+}