feat: add typescript solution to lc problem: No.1048.Longest String Chain

Author: zhaocchen

solution/1000-1099/1048.Longest String Chain/README.md

@@ -119,6 +119,26 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function longestStrChain(words: string[]): number {
+    words.sort((a, b) => a.length - b.length);
+    let ans = 0;
+    let hashTable = new Map();
+    for (let word of words) {
+        let c = 1;
+        for (let i = 0; i < word.length; i++) {
+            let pre = word.substring(0, i) + word.substring(i+1);
+            c = Math.max(c, (hashTable.get(pre) || 0) + 1);
+        }
+        hashTable.set(word, c);
+        ans = Math.max(ans, c);
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 哈希表：

solution/1000-1099/1048.Longest String Chain/README_EN.md

@@ -108,6 +108,26 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function longestStrChain(words: string[]): number {
+    words.sort((a, b) => a.length - b.length);
+    let ans = 0;
+    let hashTable = new Map();
+    for (let word of words) {
+        let c = 1;
+        for (let i = 0; i < word.length; i++) {
+            let pre = word.substring(0, i) + word.substring(i+1);
+            c = Math.max(c, (hashTable.get(pre) || 0) + 1);
+        }
+        hashTable.set(word, c);
+        ans = Math.max(ans, c);
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/1000-1099/1048.Longest String Chain/Solution.ts

@@ -0,0 +1,15 @@
+function longestStrChain(words: string[]): number {
+    words.sort((a, b) => a.length - b.length);
+    let ans = 0;
+    let hashTable = new Map();
+    for (let word of words) {
+        let c = 1;
+        for (let i = 0; i < word.length; i++) {
+            let pre = word.substring(0, i) + word.substring(i+1);
+            c = Math.max(c, (hashTable.get(pre) || 0) + 1);
+        }
+        hashTable.set(word, c);
+        ans = Math.max(ans, c);
+    }
+    return ans;
+};