lists

Documentation

Index

• type LinkedList
  • func NewLinkedList() *LinkedList
  • func RecursiveReverse(head *LinkedList) *LinkedList
  • func (l *LinkedList) Append(node *LinkedList)
  • func (l *LinkedList) GenerateLinkedList(len int)
  • func (l *LinkedList) HasCycle() bool
  • func (l *LinkedList) Insert(node *LinkedList)
  • func (l *LinkedList) PrintLindedList()
  • func (l *LinkedList) Reverse()
  • func (l *LinkedList) SwapPairs()

Types

type LinkedList

type LinkedList struct {
	Data interface{}
	Next *LinkedList
}

func NewLinkedList

func NewLinkedList() *LinkedList

func RecursiveReverse

func RecursiveReverse(head *LinkedList) *LinkedList

RecursiveReverse 递归调用反转 n - 1 子链

func (*LinkedList) Append

func (l *LinkedList) Append(node *LinkedList)

func (*LinkedList) GenerateLinkedList

func (l *LinkedList) GenerateLinkedList(len int)

func (*LinkedList) HasCycle

func (l *LinkedList) HasCycle() bool

HasCycle 通过快慢指针判断链表是否有环

func (*LinkedList) Insert

func (l *LinkedList) Insert(node *LinkedList)

func (*LinkedList) PrintLindedList

func (l *LinkedList) PrintLindedList()

func (*LinkedList) Reverse

func (l *LinkedList) Reverse()

func (*LinkedList) SwapPairs

func (l *LinkedList) SwapPairs()

SwapPairs 链表交换相临节点