data_structure

package

v0.0.0-...-10bc058 Latest Latest Go to latest Published: Apr 12, 2021 License: Apache-2.0 Imports: 2 Imported by: 0

Documentation ¶

This section is empty.

This section is empty.

This section is empty.

type DLinkedNode struct {
	Key   int
	Value int
	Prev  *DLinkedNode
	Next  *DLinkedNode
}

双向链表

type LRUCache struct {
	Capacity int
	Length   int
	Head     *DLinkedNode
	Tail     *DLinkedNode
	Nodes    map[int]*DLinkedNode
}

用一个辅助的头结点和尾结点

func Constructor(capacity int) LRUCache

func (this *LRUCache) AddToHead(node *DLinkedNode)

func (this *LRUCache) Get(key int) int

func (this *LRUCache) MoveToHead(node *DLinkedNode)

移到头部

func (this *LRUCache) Put(key int, value int)

func (this *LRUCache) RemoveNode(node *DLinkedNode)

移除节点

func (this *LRUCache) RemoveTail() *DLinkedNode

移除尾结点

type ListNode struct {
	Key  interface{}
	Val  interface{}
	Next *ListNode
}

func (l *ListNode) Del(key interface{})

func (l *ListNode) Get(key interface{}) *ListNode

func (l *ListNode) Insert(key, val interface{})

type Map struct {
	Nodes []*ListNode
}

func NewMap(n int) *Map

func (m *Map) Del(key interface{})

func (m *Map) Get(key interface{}) interface{}

func (m *Map) Store(key, val interface{})

type Trie struct {
	IsEnd    bool
	Children map[int32]*Trie
}

func ConstructorTrie() Trie

func (this *Trie) Insert(word string)

func (this *Trie) Search(word string) bool

func (this *Trie) StartsWith(prefix string) bool

func (this *Trie) Suggest(prefix string) []string

先寻到 prefix 的最末，再把 prefix 加上所有的可能值给返回出来