update: 147

Author: hijiangtao

README.md

@@ -64,7 +64,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
 | 77  | [combinations](https://leetcode.com/problems/combinations/)                                                                                     | [TypeScript](./src/combinations/res.ts)                                                                                 | Medium     |
 | 80  | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/)                                 | [JavaScript](./src/remove-duplicates-from-sorted-array-ii/res.js)                                                       | Medium     |
 | 81  | [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/)                                           | [JavaScript](./src/search-in-rotated-sorted-array-ii/res.js)                                                            | Medium     |
-| 88  | [	Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/)                                                                        | [JavaScript](./src/merge-sorted-array/res.js)                                                                           | Medium     |
+| 88  | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/)                                                                         | [JavaScript](./src/merge-sorted-array/res.js)                                                                           | Medium     |
 | 91  | [Decode Ways](https://leetcode.com/problems/decode-ways/)                                                                                       | [JavaScript](./src/decode-ways/res.js)                                                                                  | Medium     |
 | 93  | [Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/)                                                                     | [JavaScript](./src/restore-ip-addresses/res.js)                                                                         | Medium     |
 | 94  | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/)                                                   | [TypeScript](./src/binary-tree-inorder-traversal/res.ts)                                                                | Easy       |
@@ -100,6 +100,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
 | 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     |
 | 143 | [reorder-list](https://leetcode.com/problems/reorder-list/)                                                                                     | [TypeScript](./src/reorder-list/res.ts)                                                                                 | Medium     |
+| 147 | [insertion-sort-list](https://leetcode.com/problems/insertion-sort-list/)                                                                       | [TypeScript](./src/insertion-sort-list/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     |

src/insertion-sort-list/res.ts

@@ -0,0 +1,44 @@
+/**
+ * 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 insertionSortList(head: ListNode | null): ListNode | null {
+    if (!head) {
+        return null;
+    }
+
+    const dumpyHead = new ListNode(0);
+    let lastSortedNode = head;
+    dumpyHead.next = head;
+
+    while (lastSortedNode?.next) {
+        const nextNode = lastSortedNode.next;
+        if (nextNode.val >= lastSortedNode.val) {
+            lastSortedNode = nextNode;
+        } else {
+            let currentIterateNode = dumpyHead;
+            while (currentIterateNode.next && currentIterateNode.next.val < nextNode.val) {
+                currentIterateNode = currentIterateNode.next;
+            }
+
+            // link
+            lastSortedNode.next = nextNode.next;
+
+            // swap
+            const swapNode = currentIterateNode.next;
+            currentIterateNode.next = nextNode;
+            nextNode.next = swapNode;
+            lastSortedNode = swapNode as ListNode;
+        }
+    }
+
+    return dumpyHead.next;
+};