feat: add typescript solution to lc problem: No.1800.Maximum Ascendin… (doocs#444)

Author: zhaocchen

solution/1800-1899/1800.Maximum Ascending Subarray Sum/README.md

@@ -101,6 +101,24 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maxAscendingSum(nums: number[]): number {
+    let res = 0, sum = nums[0];
+    for (let i = 1; i < nums.length; ++i) {
+        if (nums[i] > nums[i - 1]) {
+            sum += nums[i];
+        } else {
+            res = Math.max(res, sum);
+            sum = nums[i];
+        }
+    }
+    res = Math.max(res, sum);
+    return res;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/1800-1899/1800.Maximum Ascending Subarray Sum/README_EN.md

@@ -91,6 +91,24 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maxAscendingSum(nums: number[]): number {
+    let res = 0, sum = nums[0];
+    for (let i = 1; i < nums.length; ++i) {
+        if (nums[i] > nums[i - 1]) {
+            sum += nums[i];
+        } else {
+            res = Math.max(res, sum);
+            sum = nums[i];
+        }
+    }
+    res = Math.max(res, sum);
+    return res;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/1800-1899/1800.Maximum Ascending Subarray Sum/Solution.ts

@@ -0,0 +1,13 @@
+function maxAscendingSum(nums: number[]): number {
+    let res = 0, sum = nums[0];
+    for (let i = 1; i < nums.length; ++i) {
+        if (nums[i] > nums[i - 1]) {
+            sum += nums[i];
+        } else {
+            res = Math.max(res, sum);
+            sum = nums[i];
+        }
+    }
+    res = Math.max(res, sum);
+    return res;
+};