Add solution #1800

Author: JoshCrozier

README.md

@@ -464,6 +464,7 @@
 1780|[Check if Number is a Sum of Powers of Three](./1780-check-if-number-is-a-sum-of-powers-of-three.js)|Medium|
 1790|[Check if One String Swap Can Make Strings Equal](./1790-check-if-one-string-swap-can-make-strings-equal.js)|Easy|
 1791|[Find Center of Star Graph](./1791-find-center-of-star-graph.js)|Easy|
+1800|[Maximum Ascending Subarray Sum](./1800-maximum-ascending-subarray-sum.js)|Easy|
 1812|[Determine Color of a Chessboard Square](./1812-determine-color-of-a-chessboard-square.js)|Easy|
 1817|[Finding the Users Active Minutes](./1817-finding-the-users-active-minutes.js)|Medium|
 1832|[Check if the Sentence Is Pangram](./1832-check-if-the-sentence-is-pangram.js)|Easy|

solutions/1800-maximum-ascending-subarray-sum.js

@@ -0,0 +1,26 @@
+/**
+ * 1800. Maximum Ascending Subarray Sum
+ * https://leetcode.com/problems/maximum-ascending-subarray-sum/
+ * Difficulty: Easy
+ *
+ * Given an array of positive integers nums, return the maximum possible sum of an
+ * ascending subarray in nums.
+ *
+ * A subarray is defined as a contiguous sequence of numbers in an array.
+ *
+ * A subarray [numsl, numsl+1, ..., numsr-1, numsr] is ascending if for all i where
+ * l <= i < r, numsi  < numsi+1. Note that a subarray of size 1 is ascending.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var maxAscendingSum = function(nums) {
+  let result = nums[0];
+  for (let i = 1, max = nums[0]; i < nums.length; i++) {
+    max = nums[i] > nums[i - 1] ? max + nums[i] : nums[i];
+    result = Math.max(result, max);
+  }
+  return result;
+};