feat: add typescript solution to lc problem: No.0243.Shortest Word Distance

Author: zhaocchen

solution/0200-0299/0243.Shortest Word Distance/README.md

@@ -73,6 +73,20 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function integerBreak(n: number): number {
+    let dp = new Array(n + 1).fill(1);
+    for (let i = 3; i <= n; i++) {
+        for (let j = 1; j < i; j++) {
+            dp[i] = Math.max(dp[i], j * (i - j), j * dp[i - j]);
+        }
+    }
+    return dp.pop();
+};
+```
+
 ### **...**
 
 ```

solution/0200-0299/0243.Shortest Word Distance/README_EN.md

@@ -75,6 +75,20 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function integerBreak(n: number): number {
+    let dp = new Array(n + 1).fill(1);
+    for (let i = 3; i <= n; i++) {
+        for (let j = 1; j < i; j++) {
+            dp[i] = Math.max(dp[i], j * (i - j), j * dp[i - j]);
+        }
+    }
+    return dp.pop();
+};
+```
+
 ### **...**
 
 ```

solution/0200-0299/0243.Shortest Word Distance/Solution.ts

@@ -0,0 +1,9 @@
+function integerBreak(n: number): number {
+    let dp = new Array(n + 1).fill(1);
+    for (let i = 3; i <= n; i++) {
+        for (let j = 1; j < i; j++) {
+            dp[i] = Math.max(dp[i], j * (i - j), j * dp[i - j]);
+        }
+    }
+    return dp.pop();
+};