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

No.1768.Merge Strings Alternately

Author: YangFong

solution/1700-1799/1768.Merge Strings Alternately/README.md

@@ -133,6 +133,20 @@ func mergeAlternately(word1 string, word2 string) string {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function mergeAlternately(word1: string, word2: string): string {
+    const res = [];
+    const n = Math.max(word1.length, word2.length);
+    for (let i = 0; i < n; i++) {
+        word1[i] && res.push(word1[i]);
+        word2[i] && res.push(word2[i]);
+    }
+    return res.join('');
+}
+```
+
 ### **Rust**
 
 ```rust

solution/1700-1799/1768.Merge Strings Alternately/README_EN.md

@@ -140,6 +140,20 @@ func mergeAlternately(word1 string, word2 string) string {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function mergeAlternately(word1: string, word2: string): string {
+    const res = [];
+    const n = Math.max(word1.length, word2.length);
+    for (let i = 0; i < n; i++) {
+        word1[i] && res.push(word1[i]);
+        word2[i] && res.push(word2[i]);
+    }
+    return res.join('');
+}
+```
+
 ### **Rust**
 
 ```rust

solution/1700-1799/1768.Merge Strings Alternately/Solution.ts

@@ -0,0 +1,9 @@
+function mergeAlternately(word1: string, word2: string): string {
+    const res = [];
+    const n = Math.max(word1.length, word2.length);
+    for (let i = 0; i < n; i++) {
+        word1[i] && res.push(word1[i]);
+        word2[i] && res.push(word2[i]);
+    }
+    return res.join('');
+}