Create 1800. Maximum Ascending Subarray Sum (#706)

Chayandas07 · Feb 4, 2025 · 0d163f8 · 0d163f8
2 parents 24b6cb5 + eeb5b29
commit 0d163f8
Showing 1 changed file with 21 additions and 0 deletions.
diff --git a/1800. Maximum Ascending Subarray Sum b/1800. Maximum Ascending Subarray Sum
@@ -0,0 +1,21 @@
+class Solution {
+public:
+    int maxAscendingSum(vector<int>& nums) {
+
+        int maxi=nums[0],sum=nums[0];
+        for(int i=0;i<nums.size()-1;i++)
+        {
+            if(nums[i+1]>nums[i])
+            {
+                sum+=nums[i+1];
+            }
+            else
+            {
+                maxi=max(maxi,sum);
+                sum=nums[i+1];
+            } 
+        }
+         maxi=max(maxi,sum);
+         return maxi;
+    }
+};