algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-07 01:44:56 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update solution 0148

Browse Source
This commit is contained in:
YDZ
2020-12-11 23:34:50 +08:00
parent 85dfc8b80c
commit 3881a5a214
2 changed files with 8 additions and 22 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
leetcode/0148.Sort-List/148. Sort List.go
View File

@ -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