-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathmain.go
55 lines (52 loc) · 887 Bytes
/
main.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
package _0021
/**
* Definition for singly-linked list.
* type ListNode struct {
* Val int
* Next *ListNode
* }
*/
type ListNode struct {
Val int
Next *ListNode
}
func mergeTwoLists(l1 *ListNode, l2 *ListNode) *ListNode {
if l1 == nil && l2 == nil {
return nil
}
if l1 == nil {
return l2
}
if l2 == nil {
return l1
}
l := &ListNode{}
merge(l1, l2, l)
return l
}
func merge(l1, l2, l *ListNode) {
if l1 == nil && l2 == nil {
return
}
if l1 == nil {
l.Val = l2.Val
if l2.Next != nil {
l.Next = &ListNode{}
merge(l1, l2.Next, l.Next)
}
} else if l2 == nil {
l.Val = l1.Val
if l1.Next != nil {
l.Next = &ListNode{}
merge(l1.Next, l2, l.Next)
}
} else if l1.Val <= l2.Val {
l.Val = l1.Val
l.Next = &ListNode{}
merge(l1.Next, l2, l.Next)
} else {
l.Val = l2.Val
l.Next = &ListNode{}
merge(l1, l2.Next, l.Next)
}
}