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
|
type Node struct {
Ele int
Next *Node
}
func PrintNode(head *Node) {
p := head
for p != nil {
if p.Next == nil {
fmt.Printf("%d", p.Ele)
} else {
fmt.Printf("%d,", p.Ele)
}
p = p.Next
}
}
func InitLinkList() *Node {
head := &Node{
Ele: 1,
Next: &Node{
Ele: 2,
Next: &Node{
Ele: 3,
Next: &Node{
Ele: 4,
Next: &Node{
Ele: 5,
Next: &Node{
Ele: 6,
Next: &Node{
Ele: 7,
Next: &Node{
Ele: 8,
Next: &Node{
Ele: 9,
Next: nil,
},
},
},
},
},
},
},
},
}
return head
}
//反转链表
func Reverse(head *Node) *Node {
if head == nil || head.Next == nil {
return head
}
var newHead *Node
p := head
for p != nil {
tmp := p.Next
p.Next = newHead
newHead = p
p = tmp
}
return newHead
}
func TestB(t *testing.T) {
head := InitLinkList()
PrintNode(head)
fmt.Println()
PrintNode(Reverse(head))
}
1,2,3,4,5,6,7,8,9
9,8,7,6,5,4,3,2,1--- PASS: TestB (0.00s)
PASS
|