leetcode-trie
proudmore
这个作者很懒,什么都没留下…
展开
-
Leetcode Implement Trie (Prefix tree)
arraylist实现前缀树。一开始犯了2个错误, (1)root应该是空的,首字母从root.next开始,这样才能存多个prefix。 (2)添加词尾结束符(leaf node),不然insert(abc)之后search(ab)返回true而不是falseclass TrieNode { // Initialize your data structure here. pub原创 2015-05-10 07:59:06 · 157 阅读 · 0 评论 -
Leetcode Word Search II
Given a 2D board and a list of words from the dictionary, find all words in the board.Each word must be constructed from letters of sequentially adjacent cell, where “adjacent” cells are those horizont原创 2015-05-20 07:53:27 · 148 阅读 · 0 评论 -
Leetcode Add and search word
Design a data structure that supports the following two operations:void addWord(word) bool search(word) search(word) can search a literal word or a regular expression string containing only letters a原创 2015-05-20 08:29:38 · 142 阅读 · 0 评论