forked from SmartsYoung/LeetCode-in-Go
-
Notifications
You must be signed in to change notification settings - Fork 0
/
ListNode.go
78 lines (68 loc) · 1.37 KB
/
ListNode.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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
package kit
import (
"fmt"
)
// ListNode 是链接节点
// 这个不能复制到*_test.go文件中。会导致Travis失败
type ListNode struct {
Val int
Next *ListNode
}
// List2Ints convert List to []int
func List2Ints(head *ListNode) []int {
// 链条深度限制,链条深度超出此限制,会 panic
limit := 100
times := 0
res := []int{}
for head != nil {
times++
if times > limit {
msg := fmt.Sprintf("链条深度超过%d,可能出现环状链条。请检查错误,或者放宽 l2s 函数中 limit 的限制。", limit)
panic(msg)
}
res = append(res, head.Val)
head = head.Next
}
return res
}
// Ints2List convert []int to List
func Ints2List(nums []int) *ListNode {
l := &ListNode{}
t := l
for _, v := range nums {
t.Next = &ListNode{Val: v}
t = t.Next
}
return l.Next
}
// GetNodeWith returns the first node with val
func (l *ListNode) GetNodeWith(val int) *ListNode {
res := l
for res != nil {
if res.Val == val {
break
}
res = res.Next
}
return res
}
// Ints2ListWithCycle returns a list whose tail point to pos-indexed node
// head's index is 0
// if pos = -1, no cycle
func Ints2ListWithCycle(nums []int, pos int) *ListNode {
head := Ints2List(nums)
if pos == -1 {
return head
}
c := head
for pos > 0 {
c = c.Next
pos--
}
tail := c
for tail.Next != nil {
tail = tail.Next
}
tail.Next = c
return head
}