Added tasks 147-148.

Author: javadev

src/main/java/g0101_0200/s0147_insertion_sort_list/Solution.java

@@ -0,0 +1,39 @@
+package g0101_0200.s0147_insertion_sort_list;
+
+import com_github_leetcode.ListNode;
+import java.util.Arrays;
+
+/*
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+public class Solution {
+    public ListNode insertionSortList(ListNode head) {
+        ListNode tnode = head;
+        ListNode res = null;
+        int count = 0;
+        while (tnode != null) {
+            count++;
+            tnode = tnode.next;
+        }
+        int[] nums = new int[count];
+        for (int i = 0; i < count; i++) {
+            nums[i] = head.val;
+            head = head.next;
+        }
+        Arrays.sort(nums);
+        for (int i = nums.length - 1; i >= 0; i--) {
+            ListNode temp = new ListNode();
+            temp.val = nums[i];
+            temp.next = res;
+            res = temp;
+        }
+        return res;
+    }
+}

src/main/java/g0101_0200/s0148_sort_list/Solution.java

@@ -0,0 +1,53 @@
+package g0101_0200.s0148_sort_list;
+
+import com_github_leetcode.ListNode;
+
+/*
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+@SuppressWarnings("java:S135")
+public class Solution {
+    public ListNode sortList(ListNode head) {
+        if (head == null || head.next == null) {
+            return head;
+        }
+        ListNode slow = head;
+        ListNode fast = head;
+        ListNode pre = slow;
+        while (fast != null && fast.next != null) {
+            pre = slow;
+            slow = slow.next;
+            fast = fast.next.next;
+        }
+        pre.next = null;
+        ListNode first = sortList(head);
+        ListNode second = sortList(slow);
+        ListNode res = new ListNode(1);
+        ListNode cur = res;
+        while (first != null || second != null) {
+            if (first == null) {
+                cur.next = second;
+                break;
+            } else if (second == null) {
+                cur.next = first;
+                break;
+            } else if (first.val <= second.val) {
+                cur.next = first;
+                first = first.next;
+                cur = cur.next;
+            } else {
+                cur.next = second;
+                second = second.next;
+                cur = cur.next;
+            }
+        }
+        return res.next;
+    }
+}

src/test/java/g0101_0200/s0147_insertion_sort_list/SolutionTest.java

@@ -0,0 +1,18 @@
+package g0101_0200.s0147_insertion_sort_list;
+
+import static org.hamcrest.CoreMatchers.equalTo;
+import static org.hamcrest.MatcherAssert.assertThat;
+
+import com_github_leetcode.ListNode;
+import org.junit.Test;
+
+public class SolutionTest {
+    @Test
+    public void insertionSortList() {
+        ListNode listNode1 = new ListNode(4);
+        listNode1.next = new ListNode(2);
+        listNode1.next.next = new ListNode(1);
+        listNode1.next.next.next = new ListNode(3);
+        assertThat(new Solution().insertionSortList(listNode1).toString(), equalTo("1, 2, 3, 4"));
+    }
+}

src/test/java/g0101_0200/s0148_sort_list/SolutionTest.java

@@ -0,0 +1,18 @@
+package g0101_0200.s0148_sort_list;
+
+import static org.hamcrest.CoreMatchers.equalTo;
+import static org.hamcrest.MatcherAssert.assertThat;
+
+import com_github_leetcode.ListNode;
+import org.junit.Test;
+
+public class SolutionTest {
+    @Test
+    public void sortList() {
+        ListNode listNode1 = new ListNode(4);
+        listNode1.next = new ListNode(2);
+        listNode1.next.next = new ListNode(1);
+        listNode1.next.next.next = new ListNode(3);
+        assertThat(new Solution().sortList(listNode1).toString(), equalTo("1, 2, 3, 4"));
+    }
+}