feat: add typescript solution to lc problem: No.0152.Maximum Product Subarray (#512)

Author: zhaocchen

solution/0100-0199/0152.Maximum Product Subarray/README.md

@@ -76,6 +76,23 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maxProduct(nums: number[]): number {
+    let n = nums.length;
+    let preMax = nums[0], preMin = nums[0], ans = nums[0];
+    for (let i = 1; i < n; ++i) {
+        let cur = nums[i];
+        let x = preMax, y = preMin;
+        preMax = Math.max(x * cur, y * cur, cur);
+        preMin = Math.min(x * cur, y * cur, cur);
+        ans = Math.max(preMax, ans);
+    }
+    return ans;
+};
+```
+
 ### **C#**
 
 ```cs

solution/0100-0199/0152.Maximum Product Subarray/README_EN.md

@@ -72,6 +72,23 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maxProduct(nums: number[]): number {
+    let n = nums.length;
+    let preMax = nums[0], preMin = nums[0], ans = nums[0];
+    for (let i = 1; i < n; ++i) {
+        let cur = nums[i];
+        let x = preMax, y = preMin;
+        preMax = Math.max(x * cur, y * cur, cur);
+        preMin = Math.min(x * cur, y * cur, cur);
+        ans = Math.max(preMax, ans);
+    }
+    return ans;
+};
+```
+
 ### **C#**
 
 ```cs

solution/0100-0199/0152.Maximum Product Subarray/Solution.ts

@@ -0,0 +1,12 @@
+function maxProduct(nums: number[]): number {
+    let n = nums.length;
+    let preMax = nums[0], preMin = nums[0], ans = nums[0];
+    for (let i = 1; i < n; ++i) {
+        let cur = nums[i];
+        let x = preMax, y = preMin;
+        preMax = Math.max(x * cur, y * cur, cur);
+        preMin = Math.min(x * cur, y * cur, cur);
+        ans = Math.max(preMax, ans);
+    }
+    return ans;
+};