feat: add typescript solution to lc problem: No.0148.Sort List (doocs#434)

Author: zhaocchen

solution/0100-0199/0148.Sort List/README.md

@@ -233,6 +233,51 @@ public class Solution {
 }
 ```
 
+### **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 sortList(head: ListNode | null): ListNode | null {
+    if (head == null || head.next == null) return head;
+    // 快慢指针定位中点
+    let slow: ListNode = head, fast: ListNode = head.next;
+    while (fast != null && fast.next != null) {
+        slow = slow.next;
+        fast = fast.next.next;
+    }
+    // 归并排序
+    let mid: ListNode = slow.next;
+    slow.next = null;
+    let l1: ListNode = sortList(head);
+    let l2: ListNode = sortList(mid);
+    let dummy: ListNode = new ListNode();
+    let cur: ListNode = dummy;
+    while (l1 != null && l2 != null) {
+        if (l1.val <= l2.val) {
+            cur.next = l1;
+            l1 = l1.next;
+        } else {
+            cur.next = l2;
+            l2 = l2.next;
+        }
+        cur = cur.next;
+    }
+    cur.next = l1 == null ? l2 : l1;
+    return dummy.next;
+};
+```
+
 ### **...**
 
 ```

solution/0100-0199/0148.Sort List/README_EN.md

@@ -217,6 +217,51 @@ public class Solution {
 }
 ```
 
+### **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 sortList(head: ListNode | null): ListNode | null {
+    if (head == null || head.next == null) return head;
+    // 快慢指针定位中点
+    let slow: ListNode = head, fast: ListNode = head.next;
+    while (fast != null && fast.next != null) {
+        slow = slow.next;
+        fast = fast.next.next;
+    }
+    // 归并排序
+    let mid: ListNode = slow.next;
+    slow.next = null;
+    let l1: ListNode = sortList(head);
+    let l2: ListNode = sortList(mid);
+    let dummy: ListNode = new ListNode();
+    let cur: ListNode = dummy;
+    while (l1 != null && l2 != null) {
+        if (l1.val <= l2.val) {
+            cur.next = l1;
+            l1 = l1.next;
+        } else {
+            cur.next = l2;
+            l2 = l2.next;
+        }
+        cur = cur.next;
+    }
+    cur.next = l1 == null ? l2 : l1;
+    return dummy.next;
+};
+```
+
 ### **...**
 
 ```

solution/0100-0199/0148.Sort List/Solution.ts

@@ -0,0 +1,40 @@
+/**
+ * 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 sortList(head: ListNode | null): ListNode | null {
+    if (head == null || head.next == null) return head;
+    // 快慢指针定位中点
+    let slow: ListNode = head, fast: ListNode = head.next;
+    while (fast != null && fast.next != null) {
+        slow = slow.next;
+        fast = fast.next.next;
+    }
+    // 归并排序
+    let mid: ListNode = slow.next;
+    slow.next = null;
+    let l1: ListNode = sortList(head);
+    let l2: ListNode = sortList(mid);
+    let dummy: ListNode = new ListNode();
+    let cur: ListNode = dummy;
+    while (l1 != null && l2 != null) {
+        if (l1.val <= l2.val) {
+            cur.next = l1;
+            l1 = l1.next;
+        } else {
+            cur.next = l2;
+            l2 = l2.next;
+        }
+        cur = cur.next;
+    }
+    cur.next = l1 == null ? l2 : l1;
+    return dummy.next;
+};