feat: update solutions to lc problem: No.0147. Insertion Sort List

Author: yanglbme

solution/0100-0199/0147.Insertion Sort List/README.md

@@ -36,7 +36,6 @@
 <strong>输出:</strong> -1-&gt;0-&gt;3-&gt;4-&gt;5
 </pre>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
@@ -57,16 +56,14 @@
 ```python
 # Definition for singly-linked list.
 # class ListNode:
-#     def __init__(self, x):
-#         self.val = x
-#         self.next = None
-
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
 class Solution:
     def insertionSortList(self, head: ListNode) -> ListNode:
         if head is None or head.next is None:
             return head
-        dummy = ListNode(head.val)
-        dummy.next = head
+        dummy = ListNode(head.val, head)
         pre, cur = dummy, head
         while cur:
             if pre.val <= cur.val:
@@ -93,16 +90,17 @@ class Solution:
  * public class ListNode {
  *     int val;
  *     ListNode next;
- *     ListNode(int x) { val = x; }
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
  * }
  */
 class Solution {
     public ListNode insertionSortList(ListNode head) {
         if (head == null || head.next == null) {
             return head;
         }
-        ListNode dummy = new ListNode(head.val);
-        dummy.next = head;
+        ListNode dummy = new ListNode(head.val, head);
         ListNode pre = dummy, cur = head;
         while (cur != null) {
             if (pre.val <= cur.val) {

solution/0100-0199/0147.Insertion Sort List/README_EN.md

@@ -39,7 +39,6 @@
 	<li><code>-5000 &lt;= Node.val &lt;= 5000</code></li>
 </ul>
 
-
 ## Solutions
 
 <!-- tabs:start -->
@@ -49,16 +48,14 @@
 ```python
 # Definition for singly-linked list.
 # class ListNode:
-#     def __init__(self, x):
-#         self.val = x
-#         self.next = None
-
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
 class Solution:
     def insertionSortList(self, head: ListNode) -> ListNode:
         if head is None or head.next is None:
             return head
-        dummy = ListNode(head.val)
-        dummy.next = head
+        dummy = ListNode(head.val, head)
         pre, cur = dummy, head
         while cur:
             if pre.val <= cur.val:
@@ -83,16 +80,17 @@ class Solution:
  * public class ListNode {
  *     int val;
  *     ListNode next;
- *     ListNode(int x) { val = x; }
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
  * }
  */
 class Solution {
     public ListNode insertionSortList(ListNode head) {
         if (head == null || head.next == null) {
             return head;
         }
-        ListNode dummy = new ListNode(head.val);
-        dummy.next = head;
+        ListNode dummy = new ListNode(head.val, head);
         ListNode pre = dummy, cur = head;
         while (cur != null) {
             if (pre.val <= cur.val) {

solution/0100-0199/0147.Insertion Sort List/Solution.java

@@ -3,16 +3,17 @@
  * public class ListNode {
  *     int val;
  *     ListNode next;
- *     ListNode(int x) { val = x; }
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
  * }
  */
 class Solution {
     public ListNode insertionSortList(ListNode head) {
         if (head == null || head.next == null) {
             return head;
         }
-        ListNode dummy = new ListNode(head.val);
-        dummy.next = head;
+        ListNode dummy = new ListNode(head.val, head);
         ListNode pre = dummy, cur = head;
         while (cur != null) {
             if (pre.val <= cur.val) {

solution/0100-0199/0147.Insertion Sort List/Solution.py

@@ -1,15 +1,13 @@
 # Definition for singly-linked list.
 # class ListNode:
-#     def __init__(self, x):
-#         self.val = x
-#         self.next = None
-
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
 class Solution:
     def insertionSortList(self, head: ListNode) -> ListNode:
         if head is None or head.next is None:
             return head
-        dummy = ListNode(head.val)
-        dummy.next = head
+        dummy = ListNode(head.val, head)
         pre, cur = dummy, head
         while cur:
             if pre.val <= cur.val:
@@ -23,4 +21,4 @@ def insertionSortList(self, head: ListNode) -> ListNode:
             p.next = cur
             pre.next = t
             cur = t
-        return dummy.next
+        return dummy.next