0. 定义节点
type LNode struct {
Data any
Next *LNode
}
type LoopLinkedList struct {
headNode *LNode
}
1. IsEmpty()
func (l *LoopLinkedList) IsEmpty() bool {
if l.headNode == nil {
return true
}
return false
}
2. Length()
func (l *LoopLinkedList) Length() int {
if l.headNode == nil {
return 0
}
currentNode := l.headNode
count := 1
for currentNode.Next != l.headNode {
count++
currentNode = currentNode.Next
}
return count
}
3. AddFromHead()
func (l *LoopLinkedList) AddFromHead(data any) {
node := &LNode{Data: data}
if l.IsEmpty() {
l.headNode = node
l.headNode.Next = l.headNode
} else {
currentNode := l.headNode
for currentNode.Next != l.headNode {
currentNode = currentNode.Next
}
currentNode.Next = node
node.Next = l.headNode
l.headNode = node
}
}
4. AddFromTail()
func (l *LoopLinkedList) AddFromTail(data any) {
node := &LNode{Data: data}
if l.IsEmpty() {
node.Next = l.headNode
l.headNode.Next = node
} else {
currentNode := l.headNode
for currentNode.Next != l.headNode {
currentNode = currentNode.Next
}
node.Next = l.headNode
currentNode.Next = node
}
}
5. Insert()
// Insert 向循环链表的指定位置添加结点(跟单链表是一样的) 下标0开始
func (l *LoopLinkedList) Insert(position int, data any) {
if position <= 0 {
l.AddFromHead(data)
} else if position >= l.Length() {
l.AddFromTail(data)
} else {
count := 0
currentNode := l.headNode
node := &LNode{Data: data}
for count != position-1 {
currentNode = currentNode.Next
count++
}
node.Next = currentNode.Next
currentNode.Next = node
}
}
6. DeleteHead()
func (l *LoopLinkedList) DeleteHead() {
if l.IsEmpty() {
fmt.Println("Loop Linked List is Empty")
return
}
currentNode := l.headNode
if currentNode.Next == l.headNode {
l.headNode = nil
} else {
for currentNode.Next != l.headNode {
currentNode = currentNode.Next
}
currentNode.Next = l.headNode.Next
l.headNode = currentNode.Next
}
}
7. DeleteTail()
func (l *LoopLinkedList) DeleteTail() {
if l.IsEmpty() {
fmt.Println("Loop Linked List is Empty")
return
}
currentNode := l.headNode
if currentNode.Next == l.headNode {
l.headNode = nil
} else {
for currentNode.Next.Next != l.headNode {
currentNode = currentNode.Next
}
currentNode.Next = l.headNode
}
}
8. Remove()
func (l *LoopLinkedList) Remove(position int) {
if l.IsEmpty() {
fmt.Println("Loop Linked List is Empty")
return
}
if position <= 0 {
l.DeleteHead()
return
} else if position >= l.Length()-1 {
l.DeleteTail()
return
} else {
count := 0
currentNode := l.headNode
for count != position-1 {
count++
currentNode = currentNode.Next
}
currentNode.Next = currentNode.Next.Next
}
}
9. RemoveByValue()
func (l *LoopLinkedList) RemoveByValue(data any) {
if l.IsEmpty() {
fmt.Println("Loop Linked List is Empty")
return
}
currentNode := l.headNode
if currentNode.Data == data {
l.DeleteHead()
return
}
for currentNode.Next != l.headNode {
if currentNode.Next.Data == data {
currentNode.Next = currentNode.Next.Next
return
} else {
currentNode = currentNode.Next
}
}
}
10. Contain()
func (l *LoopLinkedList) Contain(data any) bool {
if l.IsEmpty() {
return false
}
currentNode := l.headNode
for currentNode.Next != l.headNode {
if currentNode.Data == data {
return true
}
currentNode = currentNode.Next
}
if currentNode.Data == data {
return true
}
return false
}
11. Traverse()
func (l *LoopLinkedList) Traverse() {
if l.IsEmpty() {
fmt.Println("Loop Linked List is Empty")
return
}
currentNode := l.headNode
for currentNode.Next != l.headNode {
fmt.Printf("%v -> ", currentNode.Data)
currentNode = currentNode.Next
}
fmt.Println(currentNode.Data)
}