add 1800

fishercoder1534 · fishercoder1534 · commit ae691583b0a6 · 2021-03-21T17:14:42.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1800|[Maximum Ascending Subarray Sum](https://leetcode.com/problems/maximum-ascending-subarray-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1800.java) ||Easy|Two Pointers|
 |1797|[Design Authentication Manager](https://leetcode.com/problems/design-authentication-manager/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1797.java) ||Medium|HashTable, Design|
 |1796|[Second Largest Digit in a String](https://leetcode.com/problems/second-largest-digit-in-a-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1796.java) ||Easy|String|
 |1792|[Maximum Average Pass Ratio](https://leetcode.com/problems/maximum-average-pass-ratio/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1792.java) ||Medium|Heap|
diff --git a/src/main/java/com/fishercoder/solutions/_1800.java b/src/main/java/com/fishercoder/solutions/_1800.java
@@ -0,0 +1,19 @@
+package com.fishercoder.solutions;
+
+public class _1800 {
+    public static class Solution1 {
+        public int maxAscendingSum(int[] nums) {
+            int maxSum = nums[0];
+            for (int i = 0, j = i + 1; i < nums.length - 1 && j < nums.length; j++) {
+                int sum = nums[j - 1];
+                while (j < nums.length && nums[j] - nums[j - 1] > 0) {
+                    sum += nums[j];
+                    j++;
+                }
+                i = j;
+                maxSum = Math.max(maxSum, sum);
+            }
+            return maxSum;
+        }
+    }
+}
