Update solution 0148

Author: halfrost

leetcode/0148.Sort-List/148. Sort List.go

@@ -25,17 +25,17 @@ func sortList(head *ListNode) *ListNode {
 		return head
 	}
 
-	middleNode := middleNode1(head)
+	middleNode := middleNode(head)
 	cur = middleNode.Next
 	middleNode.Next = nil
 	middleNode = cur
 
 	left := sortList(head)
 	right := sortList(middleNode)
-	return mergeTwoLists148(left, right)
+	return mergeTwoLists(left, right)
 }
 
-func middleNode1(head *ListNode) *ListNode {
+func middleNode(head *ListNode) *ListNode {
 	if head == nil || head.Next == nil {
 		return head
 	}
@@ -48,21 +48,6 @@ func middleNode1(head *ListNode) *ListNode {
 	return p1
 }
 
-func mergeTwoLists148(l1 *ListNode, l2 *ListNode) *ListNode {
-	if l1 == nil {
-		return l2
-	}
-	if l2 == nil {
-		return l1
-	}
-	if l1.Val < l2.Val {
-		l1.Next = mergeTwoLists(l1.Next, l2)
-		return l1
-	}
-	l2.Next = mergeTwoLists(l1, l2.Next)
-	return l2
-}
-
 func mergeTwoLists(l1 *ListNode, l2 *ListNode) *ListNode {
 	if l1 == nil {
 		return l2

website/content/ChapterFour/0148.Sort-List.md

@@ -54,17 +54,17 @@ func sortList(head *ListNode) *ListNode {
 		return head
 	}
 
-	middleNode := middleNode1(head)
+	middleNode := middleNode(head)
 	cur = middleNode.Next
 	middleNode.Next = nil
 	middleNode = cur
 
 	left := sortList(head)
 	right := sortList(middleNode)
-	return mergeTwoLists148(left, right)
+	return mergeTwoLists(left, right)
 }
 
-func middleNode1(head *ListNode) *ListNode {
+func middleNode(head *ListNode) *ListNode {
 	if head == nil || head.Next == nil {
 		return head
 	}
@@ -77,7 +77,7 @@ func middleNode1(head *ListNode) *ListNode {
 	return p1
 }
 
-func mergeTwoLists148(l1 *ListNode, l2 *ListNode) *ListNode {
+func mergeTwoLists(l1 *ListNode, l2 *ListNode) *ListNode {
 	if l1 == nil {
 		return l2
 	}
@@ -92,4 +92,5 @@ func mergeTwoLists148(l1 *ListNode, l2 *ListNode) *ListNode {
 	return l2
 }
 
+
 ```