feat: add typescript solution to lc problem: No.2181

No.2181.Merge Nodes in Between Zeros

Author: zhaocchen

solution/2100-2199/2181.Merge Nodes in Between Zeros/README.md

@@ -75,7 +75,36 @@
 ### **TypeScript**
 
 ```ts
-
+/**
+ * Definition for singly-linked list.
+ * class ListNode {
+ *     val: number
+ *     next: ListNode | null
+ *     constructor(val?: number, next?: ListNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.next = (next===undefined ? null : next)
+ *     }
+ * }
+ */
+
+function mergeNodes(head: ListNode | null): ListNode | null {
+    let dummy = new ListNode(-1);
+    let p = dummy;
+    let sum = 0;
+    head = head.next;
+    while (head != null) {
+        let cur = head.val;
+        if (cur) {
+            sum += cur;
+        } else {
+            p.next = new ListNode(sum);
+            p = p.next;
+            sum = 0;
+        }
+        head = head.next;
+    }
+    return dummy.next;
+};
 ```
 
 ### **...**

solution/2100-2199/2181.Merge Nodes in Between Zeros/README_EN.md

@@ -63,7 +63,36 @@ The above figure represents the given linked list. The modified list contains
 ### **TypeScript**
 
 ```ts
-
+/**
+ * Definition for singly-linked list.
+ * class ListNode {
+ *     val: number
+ *     next: ListNode | null
+ *     constructor(val?: number, next?: ListNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.next = (next===undefined ? null : next)
+ *     }
+ * }
+ */
+
+function mergeNodes(head: ListNode | null): ListNode | null {
+    let dummy = new ListNode(-1);
+    let p = dummy;
+    let sum = 0;
+    head = head.next;
+    while (head != null) {
+        let cur = head.val;
+        if (cur) {
+            sum += cur;
+        } else {
+            p.next = new ListNode(sum);
+            p = p.next;
+            sum = 0;
+        }
+        head = head.next;
+    }
+    return dummy.next;
+};
 ```
 
 ### **...**

solution/2100-2199/2181.Merge Nodes in Between Zeros/Solution.ts

@@ -0,0 +1,30 @@
+/**
+ * Definition for singly-linked list.
+ * class ListNode {
+ *     val: number
+ *     next: ListNode | null
+ *     constructor(val?: number, next?: ListNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.next = (next===undefined ? null : next)
+ *     }
+ * }
+ */
+
+ function mergeNodes(head: ListNode | null): ListNode | null {
+    let dummy = new ListNode(-1);
+    let p = dummy;
+    let sum = 0;
+    head = head.next;
+    while (head != null) {
+        let cur = head.val;
+        if (cur) {
+            sum += cur;
+        } else {
+            p.next = new ListNode(sum);
+            p = p.next;
+            sum = 0;
+        }
+        head = head.next;
+    }
+    return dummy.next;
+};