solves maximum ascending sub array sum

Author: anishLearnsToCode

README.md

@@ -438,7 +438,7 @@
 | 1790 | [Check if One String Swap Can Make Strings Equal](https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal)                          |                                                     [![Java](assets/java.png)](src/CheckIfOneStringSwapCanMakeStringsEqual.java)                                                     |                                                                                                                                   |
 | 1791 | [Find Center of Star Graph](https://leetcode.com/problems/find-center-of-star-graph)                                                                      |                                                              [![Java](assets/java.png)](src/FindCenterOfStarGraph.java)                                                              |                                                                                                                                   |
 | 1796 | [Second Largest Digit in a String](https://leetcode.com/problems/second-largest-digit-in-a-string)                                                        |                                                           [![Java](assets/java.png)](src/SecondLargestDigitInAString.java)                                                           |                                                                                                                                   |
-| 1800 | [Maximum Ascending Subarray Sum](https://leetcode.com/problems/maximum-ascending-subarray-sum)                                                            |                                                                                                                                                                                      |                                                                                                                                   |
+| 1800 | [Maximum Ascending Subarray Sum](https://leetcode.com/problems/maximum-ascending-subarray-sum)                                                            |                                                           [![Java](assets/java.png)](src/MaximumAscendingSubArraySum.java)                                                           |                                                                                                                                   |
 | 1805 | [Number of Different Integers in a String](https://leetcode.com/problems/number-of-different-integers-in-a-string)                                        |                                                                                                                                                                                      |                                                                                                                                   |
 | 1812 | [Determine Color of a Chessboard Square](https://leetcode.com/problems/determine-color-of-a-chessboard-square)                                            |                                                                                                                                                                                      |                                                                                                                                   |
 | 1816 | [Truncate Sentence](https://leetcode.com/problems/truncate-sentence)                                                                                      |                                                                                                                                                                                      |                                                                                                                                   |

src/MaximumAscendingSubArraySum.java

@@ -0,0 +1,12 @@
+public class MaximumAscendingSubArraySum {
+    public int maxAscendingSum(int[] nums) {
+        int maxSum = nums[0];
+        for (int index = 1, current = nums[0] ; index < nums.length ; index++) {
+            if (nums[index] > nums[index - 1]) {
+                current += nums[index];
+            } else current = nums[index];
+            maxSum = Math.max(maxSum, current);
+        }
+        return maxSum;
+    }
+}