Added Maximum Ascending Subarray Sum.java

varunu28 · web-flow · commit 6b7bd7d4d0cc · 2021-03-21T09:08:03.000-07:00
diff --git a/Easy/Maximum Ascending Subarray Sum.java b/Easy/Maximum Ascending Subarray Sum.java
@@ -0,0 +1,14 @@
+class Solution {
+  public int maxAscendingSum(int[] nums) {
+    int maximumSum = 0;
+    int idx = 0;
+    while (idx < nums.length) {
+      int currSum = nums[idx++];
+      while (idx < nums.length && nums[idx] > nums[idx - 1]) {
+        currSum += nums[idx++];
+      }
+      maximumSum = Math.max(maximumSum, currSum);
+    }
+    return maximumSum;
+  }
+}
