Merge pull request #170 from fartem/insertion-sort-list

2023-01-21 update: added "147. Insertion Sort List"

Author: fartem

README.md

@@ -510,6 +510,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 142. Linked List Cycle II                                                           | [Link](https://leetcode.com/problems/linked-list-cycle-ii/)                                                          | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/LinkedListCycleII.java)                                               |
 | 143. Reorder List                                                                   | [Link](https://leetcode.com/problems/reorder-list/)                                                                  | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/ReorderList.java)                                                     |
 | 146. LRU Cache                                                                      | [Link](https://leetcode.com/problems/lru-cache/)                                                                     | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/LRUCache.java)                                                        |
+| 147. Insertion Sort List                                                            | [Link](https://leetcode.com/problems/insertion-sort-list/)                                                           | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/InsertionSortList.java)                                               |
 | 148. Sort List                                                                      | [Link](https://leetcode.com/problems/sort-list/)                                                                     | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/SortList.java)                                                        |
 | 150. Evaluate Reverse Polish Notation                                               | [Link](https://leetcode.com/problems/evaluate-reverse-polish-notation/)                                              | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/EvaluateReversePolishNotation.java)                                   |
 | 151. Reverse Words in a String                                                      | [Link](https://leetcode.com/problems/reverse-words-in-a-string/)                                                     | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/ReverseWordsInAString.java)                                           |

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/InsertionSortList.java

@@ -0,0 +1,30 @@
+package com.smlnskgmail.jaman.leetcodejava.medium;
+
+import com.smlnskgmail.jaman.leetcodejava.support.ListNode;
+
+// https://leetcode.com/problems/insertion-sort-list/
+public class InsertionSortList {
+
+    private final ListNode input;
+
+    public InsertionSortList(ListNode input) {
+        this.input = input;
+    }
+
+    public ListNode solution() {
+        ListNode result = new ListNode();
+        ListNode curr = input;
+        while (curr != null) {
+            ListNode prev = result;
+            while (prev.next != null && prev.next.val <= curr.val) {
+                prev = prev.next;
+            }
+            ListNode next = curr.next;
+            curr.next = prev.next;
+            prev.next = curr;
+            curr = next;
+        }
+        return result.next;
+    }
+
+}

src/test/java/com/smlnskgmail/jaman/leetcodejava/medium/InsertionSortListTest.java

@@ -0,0 +1,30 @@
+package com.smlnskgmail.jaman.leetcodejava.medium;
+
+import com.smlnskgmail.jaman.leetcodejava.support.ListNode;
+import org.junit.Test;
+
+import static org.junit.Assert.assertTrue;
+
+public class InsertionSortListTest {
+
+    @Test
+    public void defaultTests() {
+        assertTrue(
+                ListNode.areEqual(
+                        ListNode.fromNumbers(1, 2, 3, 4),
+                        new InsertionSortList(
+                                ListNode.fromNumbers(4, 2, 1, 3)
+                        ).solution()
+                )
+        );
+        assertTrue(
+                ListNode.areEqual(
+                        ListNode.fromNumbers(-1, 0, 3, 4, 5),
+                        new InsertionSortList(
+                                ListNode.fromNumbers(-1, 5, 3, 4, 0)
+                        ).solution()
+                )
+        );
+    }
+
+}