-
Notifications
You must be signed in to change notification settings - Fork 0
/
23.go
57 lines (45 loc) · 781 Bytes
/
23.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
56
57
package main
type ListNode struct {
Val int
Next *ListNode
}
func mergeKLists(lists []*ListNode) *ListNode {
var head, tail *ListNode
a := []*ListNode{}
for _, list := range lists {
if list != nil {
a = append(a, list)
}
}
lists = a
for len(lists) > 1 {
x := lists[0]
index := 0
for i, list := range lists {
if x.Val > list.Val {
x = list
index = i
}
}
newNode := &ListNode{Val: x.Val}
if head == nil {
head = newNode
}
if tail != nil {
tail.Next = newNode
}
tail = newNode
lists[index] = lists[index].Next
if lists[index] == nil {
lists = append(lists[:index], lists[index+1:]...)
}
}
if len(lists) == 1 {
if head == nil {
head = lists[0]
} else {
tail.Next = lists[0]
}
}
return head
}