feat: add typescript solution to lc problem: No.0918.Maximum Sum Circular Subarray (doocs#510)

zhaocchen · web-flow · commit 0f41fea871c5 · 2021-07-13T22:19:56.000+08:00
diff --git a/solution/0900-0999/0918.Maximum Sum Circular Subarray/README.md b/solution/0900-0999/0918.Maximum Sum Circular Subarray/README.md
@@ -108,6 +108,27 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maxSubarraySumCircular(nums: number[]): number {
+    let pre1 = nums[0], pre2 = nums[0];
+    let ans1 = nums[0], ans2 = nums[0];
+    let sum = nums[0];
+    
+    for (let i = 1; i < nums.length; ++i) {
+        let cur = nums[i];
+        sum += cur;
+        pre1 = Math.max(pre1 + cur, cur);
+        ans1 = Math.max(pre1, ans1);
+
+        pre2 = Math.min(pre2 + cur, cur);
+        ans2 = Math.min(pre2, ans2);
+    }
+    return ans1 > 0 ? Math.max(ans1, sum - ans2) : ans1;
+};
+```
+
 ### **C++**
 
 ```cpp
diff --git a/solution/0900-0999/0918.Maximum Sum Circular Subarray/README_EN.md b/solution/0900-0999/0918.Maximum Sum Circular Subarray/README_EN.md
@@ -167,6 +167,27 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maxSubarraySumCircular(nums: number[]): number {
+    let pre1 = nums[0], pre2 = nums[0];
+    let ans1 = nums[0], ans2 = nums[0];
+    let sum = nums[0];
+    
+    for (let i = 1; i < nums.length; ++i) {
+        let cur = nums[i];
+        sum += cur;
+        pre1 = Math.max(pre1 + cur, cur);
+        ans1 = Math.max(pre1, ans1);
+
+        pre2 = Math.min(pre2 + cur, cur);
+        ans2 = Math.min(pre2, ans2);
+    }
+    return ans1 > 0 ? Math.max(ans1, sum - ans2) : ans1;
+};
+```
+
 ### **C++**
 
 ```cpp
diff --git a/solution/0900-0999/0918.Maximum Sum Circular Subarray/Solution.ts b/solution/0900-0999/0918.Maximum Sum Circular Subarray/Solution.ts
@@ -0,0 +1,16 @@
+function maxSubarraySumCircular(nums: number[]): number {
+    let pre1 = nums[0], pre2 = nums[0];
+    let ans1 = nums[0], ans2 = nums[0];
+    let sum = nums[0];
+    
+    for (let i = 1; i < nums.length; ++i) {
+        let cur = nums[i];
+        sum += cur;
+        pre1 = Math.max(pre1 + cur, cur);
+        ans1 = Math.max(pre1, ans1);
+
+        pre2 = Math.min(pre2 + cur, cur);
+        ans2 = Math.min(pre2, ans2);
+    }
+    return ans1 > 0 ? Math.max(ans1, sum - ans2) : ans1;
+};
