New Problem Solution -"Maximum Ascending Subarray Sum"

Author: haoel

README.md

@@ -9,6 +9,7 @@ LeetCode
 
 | # | Title | Solution | Difficulty |
 |---| ----- | -------- | ---------- |
+|1800|[Maximum Ascending Subarray Sum](https://leetcode.com/problems/maximum-ascending-subarray-sum/) | [C++](./algorithms/cpp/maximumAscendingSubarraySum/MaximumAscendingSubarraySum.cpp)|Easy|
 |1793|[Maximum Score of a Good Subarray](https://leetcode.com/problems/maximum-score-of-a-good-subarray/) | [C++](./algorithms/cpp/maximumScoreOfAGoodSubarray/MaximumScoreOfAGoodSubarray.cpp)|Hard|
 |1792|[Maximum Average Pass Ratio](https://leetcode.com/problems/maximum-average-pass-ratio/) | [C++](./algorithms/cpp/maximumAveragePassRatio/MaximumAveragePassRatio.cpp)|Medium|
 |1791|[Find Center of Star Graph](https://leetcode.com/problems/find-center-of-star-graph/) | [C++](./algorithms/cpp/findCenterOfStarGraph/FindCenterOfStarGraph.cpp)|Medium|

algorithms/cpp/maximumAscendingSubarraySum/MaximumAscendingSubarraySum.cpp

@@ -0,0 +1,60 @@
+// Source : https://leetcode.com/problems/maximum-ascending-subarray-sum/
+// Author : Hao Chen
+// Date   : 2021-03-21
+
+/***************************************************************************************************** 
+ *
+ * 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.
+ * 
+ * Example 1:
+ * 
+ * Input: nums = [10,20,30,5,10,50]
+ * Output: 65
+ * Explanation: [5,10,50] is the ascending subarray with the maximum sum of 65.
+ * 
+ * Example 2:
+ * 
+ * Input: nums = [10,20,30,40,50]
+ * Output: 150
+ * Explanation: [10,20,30,40,50] is the ascending subarray with the maximum sum of 150.
+ * 
+ * Example 3:
+ * 
+ * Input: nums = [12,17,15,13,10,11,12]
+ * Output: 33
+ * Explanation: [10,11,12] is the ascending subarray with the maximum sum of 33.
+ * 
+ * Example 4:
+ * 
+ * Input: nums = [100,10,1]
+ * Output: 100
+ * 
+ * Constraints:
+ * 
+ * 	1 <= nums.length <= 100
+ * 	1 <= nums[i] <= 100
+ ******************************************************************************************************/
+
+class Solution {
+public:
+    int maxAscendingSum(vector<int>& nums) {
+        int maxSum = nums[0];
+        int sum = maxSum;
+        for(int i=1; i<nums.size(); i++) {
+            if (nums[i] > nums[i-1]) {
+                sum += nums[i];
+            }else{
+                maxSum = maxSum < sum ? sum : maxSum;
+                sum = nums[i];
+            }
+        }
+        maxSum = maxSum < sum ? sum : maxSum;
+        return maxSum;
+    }
+};