problem0208

package
Version: v0.0.0-...-db5e768 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Jul 25, 2019 License: MIT Imports: 0 Imported by: 0

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

Constants

This section is empty.

Variables

This section is empty.

Functions

This section is empty.

Types

type Trie

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

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

func Constructor

func Constructor() Trie

func (*Trie) Insert

func (this *Trie) Insert(word string)

func (*Trie) Search

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

func (*Trie) StartsWith

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

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
t or T : Toggle theme light dark auto
y or Y : Canonical URL