Problem0208

README

208. Implement Trie (Prefix Tree)

题目

Implement a trie with insert, search, and startsWith methods.

Note: You may assume that all inputs are consist of lowercase letters a-z.

解题思路

见程序注释

Documentation

Index

• type Trie
  • func Constructor() Trie
  • func (t *Trie) Insert(word string)
  • func (t *Trie) Search(word string) bool
  • func (t *Trie) StartsWith(prefix string) bool

Types

type Trie

type Trie struct {
	// contains filtered or unexported fields
}

Trie 是便于 word 插入与查找的数据结构

func Constructor

func Constructor() Trie

Constructor initialize your data structure here.

func (*Trie) Insert

func (t *Trie) Insert(word string)

Insert a word into the trie.

func (*Trie) Search

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

Search returns true if the word is in the trie.

func (*Trie) StartsWith

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

StartsWith returns true if there is any word in the trie that starts with the given prefix.