feat: add ts solution to lc problem: No.0123

Author: thinkasany

solution/0100-0199/0123.Best Time to Buy and Sell Stock III/README.md

@@ -195,6 +195,24 @@ public class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maxProfit(prices: number[]): number {
+    let f1 = -prices[0],
+        f2 = 0,
+        f3 = -prices[0],
+        f4 = 0;
+    for (let i = 1; i < prices.length; ++i) {
+        f1 = Math.max(f1, -prices[i]);
+        f2 = Math.max(f2, f1 + prices[i]);
+        f3 = Math.max(f3, f2 - prices[i]);
+        f4 = Math.max(f4, f3 + prices[i]);
+    }
+    return f4;
+}
+```
+
 ### **...**
 
 ```

solution/0100-0199/0123.Best Time to Buy and Sell Stock III/README_EN.md

@@ -161,6 +161,24 @@ public class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maxProfit(prices: number[]): number {
+    let f1 = -prices[0],
+        f2 = 0,
+        f3 = -prices[0],
+        f4 = 0;
+    for (let i = 1; i < prices.length; ++i) {
+        f1 = Math.max(f1, -prices[i]);
+        f2 = Math.max(f2, f1 + prices[i]);
+        f3 = Math.max(f3, f2 - prices[i]);
+        f4 = Math.max(f4, f3 + prices[i]);
+    }
+    return f4;
+}
+```
+
 ### **...**
 
 ```

solution/0100-0199/0123.Best Time to Buy and Sell Stock III/Solution.ts

@@ -0,0 +1,13 @@
+function maxProfit(prices: number[]): number {
+    let f1 = -prices[0],
+        f2 = 0,
+        f3 = -prices[0],
+        f4 = 0;
+    for (let i = 1; i < prices.length; ++i) {
+        f1 = Math.max(f1, -prices[i]);
+        f2 = Math.max(f2, f1 + prices[i]);
+        f3 = Math.max(f3, f2 - prices[i]);
+        f4 = Math.max(f4, f3 + prices[i]);
+    }
+    return f4;
+}