package main
import "fmt"
// Node 定义链表节点
type Node struct {
data int
next *Node
}
// LinkedList 定义链表
type LinkedList struct {
head *Node
}
// Append 在链表末尾添加新节点
func (l *LinkedList) Append(data int) {
newNode := &Node{data: data}
if l.head == nil {
l.head = newNode
} else {
current := l.head
for ; current.next != nil; current = current.next {
}
current.next = newNode
}
}
// Print 打印链表所有节点
func (l *LinkedList) Print() {
current := l.head
for current != nil {
fmt.Print(current.data, " ")
current = current.next
}
fmt.Println()
}
func main() {
list := LinkedList{}
list.Append(1)
list.Append(2)
list.Append(3)
list.Print() // 输出: 1 2 3
}