Go语言双向链表list.List的实现示例

// List represents a doubly linked list.
// The zero value for List is an empty list ready to use.
type List struct {
	root Element // sentinel list element, only &root, root.prev, and root.next are used
	len  int     // current list length excluding (this) sentinel element
}

// Element is an element of a linked list.
type Element struct {
	// Next and previous pointers in the doubly-linked list of elements.
	// To simplify the implementation, internally a list l is implemented
	// as a ring, such that &l.root is both the next element of the last
	// list element (l.Back()) and the previous element of the first list
	// element (l.Front()).
	next, prev *Element

	// The list to which this element belongs.
	list *List

	// The value stored with this element.
	Value any
}

// 通过new方法初始化
lt1 := list.New()

// 通过声明初始化
var lt2 list.List

func main() {

    lt1 := list.New()

    // 链表尾部插入数据
    lt1.PushBack("back")

    // 链表头部插入数据
    lt1.PushFront("front")

    // 在链表尾部元素之前插入数据
    lt1.InsertBefore("before", lt1.Back())
    
    // 在链表尾部元素之后插入数据
    lt1.InsertAfter("after", lt1.Back())
}

// 删除元素
lt1.Remove(lt1.Front())

// 将元素移动到头部
lt1.MoveToFront(lt1.Back())

// 将元素移动到尾部
lt1.MoveToBack(lt1.Front())

// 将元素移动到指定元素之前
e1 := lt1.PushBack("e1")
lt1.MoveBefore(e1, lt1.Back())

// 将元素移动到指定元素之前
e2 := lt1.PushBack("e2")
lt1.MoveAfter(e2, lt1.Front())

// 从头部访问元素
e3 := lt1.Front()

// 从尾部访问元素
e4 := lt1.Back()

// 从头部向尾部开始遍历
for e := lt1.Front(); e != nil; e = e.Next() {
    fmt.Print(e.Value, " ")
}

// 从尾部向头部部开始遍历
for e := lt1.Back(); e != nil; e = e.Prev() {
    fmt.Print(e.Value, " ")
}

lt2 := list.New()
lt2.PushBack("11")

lt3 := list.New()
lt3.PushBack("33")

lt4 := list.New()
lt4.PushBack("44")

// 将链表合并到头部
lt2.PushFrontList(lt3)

// 将链表合并到尾部
lt2.PushBackList(lt4)