From dcab2e1a577538e2da675d2831ddd7e361e42b31 Mon Sep 17 00:00:00 2001
From: zhaocchen <zhaocchen@163.com>
Date: Thu, 10 Jun 2021 23:07:55 +0800
Subject: [PATCH 1/2] feat: add typescript solution to lc problem:
 No.1800.Maximum Ascending Subarray Sum

---
 .../README.md                                 | 22 +++++++++++++++++++
 .../README_EN.md                              | 22 +++++++++++++++++++
 .../Solution.ts                               | 17 ++++++++++++++
 3 files changed, 61 insertions(+)
 create mode 100644 solution/1800-1899/1800.Maximum Ascending Subarray Sum/Solution.ts

diff --git a/solution/1800-1899/1800.Maximum Ascending Subarray Sum/README.md b/solution/1800-1899/1800.Maximum Ascending Subarray Sum/README.md
index c4eb5b5228a7a..df335a3a58104 100644
--- a/solution/1800-1899/1800.Maximum Ascending Subarray Sum/README.md	
+++ b/solution/1800-1899/1800.Maximum Ascending Subarray Sum/README.md	
@@ -101,6 +101,28 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var maxAscendingSum = function(nums) {
+    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
diff --git a/solution/1800-1899/1800.Maximum Ascending Subarray Sum/README_EN.md b/solution/1800-1899/1800.Maximum Ascending Subarray Sum/README_EN.md
index a1426456b5c76..b8c1350a187a9 100644
--- a/solution/1800-1899/1800.Maximum Ascending Subarray Sum/README_EN.md	
+++ b/solution/1800-1899/1800.Maximum Ascending Subarray Sum/README_EN.md	
@@ -91,6 +91,28 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var maxAscendingSum = function(nums) {
+    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
diff --git a/solution/1800-1899/1800.Maximum Ascending Subarray Sum/Solution.ts b/solution/1800-1899/1800.Maximum Ascending Subarray Sum/Solution.ts
new file mode 100644
index 0000000000000..2400284a769d9
--- /dev/null
+++ b/solution/1800-1899/1800.Maximum Ascending Subarray Sum/Solution.ts	
@@ -0,0 +1,17 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+ var maxAscendingSum = function(nums) {
+    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;
+};
\ No newline at end of file

From 433f0783907db0be7bc945ac30f01eccc1f80666 Mon Sep 17 00:00:00 2001
From: zhaocchen <zhaocchen@163.com>
Date: Thu, 10 Jun 2021 23:17:08 +0800
Subject: [PATCH 2/2] fix: fix typescript solution to lc problem:
 No.1800.Maximum Ascending Subarray Sum

---
 .../1800-1899/1800.Maximum Ascending Subarray Sum/README.md | 6 +-----
 .../1800.Maximum Ascending Subarray Sum/README_EN.md        | 6 +-----
 .../1800.Maximum Ascending Subarray Sum/Solution.ts         | 6 +-----
 3 files changed, 3 insertions(+), 15 deletions(-)

diff --git a/solution/1800-1899/1800.Maximum Ascending Subarray Sum/README.md b/solution/1800-1899/1800.Maximum Ascending Subarray Sum/README.md
index df335a3a58104..922cc963f3a9e 100644
--- a/solution/1800-1899/1800.Maximum Ascending Subarray Sum/README.md	
+++ b/solution/1800-1899/1800.Maximum Ascending Subarray Sum/README.md	
@@ -104,11 +104,7 @@ class Solution {
 ### **TypeScript**
 
 ```ts
-/**
- * @param {number[]} nums
- * @return {number}
- */
-var maxAscendingSum = function(nums) {
+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]) {
diff --git a/solution/1800-1899/1800.Maximum Ascending Subarray Sum/README_EN.md b/solution/1800-1899/1800.Maximum Ascending Subarray Sum/README_EN.md
index b8c1350a187a9..2157f23bbe15f 100644
--- a/solution/1800-1899/1800.Maximum Ascending Subarray Sum/README_EN.md	
+++ b/solution/1800-1899/1800.Maximum Ascending Subarray Sum/README_EN.md	
@@ -94,11 +94,7 @@ class Solution {
 ### **TypeScript**
 
 ```ts
-/**
- * @param {number[]} nums
- * @return {number}
- */
-var maxAscendingSum = function(nums) {
+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]) {
diff --git a/solution/1800-1899/1800.Maximum Ascending Subarray Sum/Solution.ts b/solution/1800-1899/1800.Maximum Ascending Subarray Sum/Solution.ts
index 2400284a769d9..a7fab83773936 100644
--- a/solution/1800-1899/1800.Maximum Ascending Subarray Sum/Solution.ts	
+++ b/solution/1800-1899/1800.Maximum Ascending Subarray Sum/Solution.ts	
@@ -1,8 +1,4 @@
-/**
- * @param {number[]} nums
- * @return {number}
- */
- var maxAscendingSum = function(nums) {
+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]) {