Method search

implement_trie_208/solution.go:51–67

(word string, needsEnd bool)

}

func (this *Trie) search(word string, needsEnd bool) bool {
	curr := this.root
	for i := 0; i < len(word); i++ {
		slot := word[i] - 'a'
		if curr.children[slot] == nil {
			return false
		}

		curr = curr.children[slot]
	}

	if needsEnd {
		return curr.end
	}

	return true
}