feat: add ts solution to lcci problem: No.02.04

No.02.04.Partition List

Author: YangFong

lcci/02.04.Partition List/README.md

@@ -123,6 +123,38 @@ public:
 };
 ```
 
+### **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 partition(head: ListNode | null, x: number): ListNode | null {
+    if (head == null) {
+        return head;
+    }
+    let cur = head;
+    while (cur.next != null) {
+        let node = cur.next;
+        if (node.val < x) {
+            [head, node.next, cur.next] = [node, head, node.next];
+        } else {
+            cur = cur.next;
+        }
+    }
+    return head;
+}
+```
+
 ### **...**
 
 ```

lcci/02.04.Partition List/README_EN.md

@@ -118,6 +118,38 @@ public:
 };
 ```
 
+### **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 partition(head: ListNode | null, x: number): ListNode | null {
+    if (head == null) {
+        return head;
+    }
+    let cur = head;
+    while (cur.next != null) {
+        let node = cur.next;
+        if (node.val < x) {
+            [head, node.next, cur.next] = [node, head, node.next];
+        } else {
+            cur = cur.next;
+        }
+    }
+    return head;
+}
+```
+
 ### **...**
 
 ```

lcci/02.04.Partition List/Solution.ts

@@ -0,0 +1,27 @@
+/**
+ * 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 partition(head: ListNode | null, x: number): ListNode | null {
+    if (head == null) {
+        return head;
+    }
+    let cur = head;
+    while (cur.next != null) {
+        let node = cur.next;
+        if (node.val < x) {
+            [head, node.next, cur.next] = [node, head, node.next];
+        } else {
+            cur = cur.next;
+        }
+    }
+    return head;
+}