数据结构【Golang实现】(四)——双向循环链表

0. 定义节点

type DLNode struct {
   
	Data       any
	Prev, Next *DLNode
}

// DoublyLoopLinkedList 双向循环链表
type DoublyLoopLinkedList struct {
   
	headNode *DLNode
}

1. IsEmpty()

// IsEmpty 判断链表是否为空
func (l *DoublyLoopLinkedList) IsEmpty() bool {
   
	if l.headNode == nil {
   
		return true
	}
	return false
}

2. Length()

// Length 获取链表长度
func (l *DoublyLoopLinkedList) Length() int {
   
	if l.IsEmpty() {
   
		return 0
	}
	currentNode := l.headNode
	count := 1
	for currentNode.Next != l.headNode {
   
		count++
		currentNode = currentNode.Next
	}
	return count
}

3. AddFromHead()

// AddFromHead 从双向循环链表头部增加节点
func (l *DoublyLoopLinkedList) AddFromHead(data any) {
   
	node := &DLNode{
   Data: data}
	if l.IsEmpty() {
   
		l.headNode = node
		return
	}
	currentNode := l.headNode
	for currentNode.Next != l.headNode {
    // 遍历到尾结点
		currentNode = currentNode.Next
	}
	currentNode.Next = node
	l.headNode.Prev = node
	node.Prev = currentNode
	node.Next = l.headNode
	l.headN