update: 148

Author: hijiangtao

README.md

@@ -88,6 +88,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
 | 136 | [Single Number](https://leetcode.com/problems/single-number/)                                                                                   | [JavaScript](./src/single-number/res.js)                                                                          | Easy       |
 | 137 | [Single Number II](https://leetcode.com/problems/single-number-ii/)                                                                             | [JavaScript](./src/single-number-ii/res.js)                                                                       | Medium     |
 | 139 | [word-break](https://leetcode.com/problems/word-break/)                                                                                         | [TypeScript](./src/word-break/res.ts)                                                                             | Medium     |
+| 148 | [sort-list](https://leetcode.com/problems/sort-list/)                                                                                           | [TypeScript](./src/sort-list/res.ts)                                                                              | Medium     |
 | 151 | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/)                                                           | [JavaScript](./src/reverse-words-in-a-string/res.js)                                                              | Medium     |
 | 152 | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)                                                             | [JavaScript](./src/maximum-product-subarray/res.js)                                                               | Medium     |
 | 153 | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)                                     | [JavaScript](./src/find-minimum-in-rotated-sorted-array/res.js)                                                   | Medium     |

src/sort-list/res.ts

@@ -0,0 +1,65 @@
+/**
+ * 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 merge(start: ListNode | null, end: ListNode | null): ListNode | null {
+    let result: ListNode | null = new ListNode(0);
+    let resultPoint = result;
+    while (start && end) {
+        if (start.val > end.val) {
+            resultPoint.next = end;
+            end = end.next;
+        } else {
+            resultPoint.next = start;
+            start = start.next;
+        }
+
+        resultPoint = resultPoint.next;
+    }
+
+    if (start) {
+        resultPoint.next = start;
+    } else {
+        resultPoint.next = end;
+    }
+
+    return result.next;
+}
+
+function sortWithRange(start: ListNode | null, end: ListNode | null): ListNode | null {
+    if (!start) {
+        return start;
+    }
+    if (start.next === end) {
+        start.next = null;
+        return start;
+    }
+
+    let midPoint: ListNode | null = start;
+    let endPoint: ListNode | null = start;
+    while(endPoint !== end) {
+        midPoint = midPoint?.next;
+        endPoint = endPoint?.next;
+
+        if (endPoint !== end) {
+            endPoint = endPoint?.next;
+        }
+    }
+
+    const leftNode = sortWithRange(start, midPoint);
+    const rightNode = sortWithRange(midPoint, end);
+
+    return merge(leftNode, rightNode);
+}
+
+function sortList(head: ListNode | null): ListNode | null {
+    return sortWithRange(head, null);
+};