Trie
文章平均质量分 75
ForABiggerWorld
这个作者很懒,什么都没留下…
展开
-
745. Prefix and Suffix Search
Given many words, words[i] has weight i.Design a class WordFilter that supports one function, WordFilter.f(String prefix, String suffix). It will return the word with given prefix and suffix with maxi...原创 2017-12-19 19:14:06 · 925 阅读 · 0 评论 -
745. Prefix and Suffix Search
Given many words, words[i] has weight i.Design a class WordFilter that supports one function, WordFilter.f(String prefix, String suffix). It will return the word with given prefix and suffix with maxi...原创 2017-12-10 12:25:05 · 251 阅读 · 0 评论 -
676. Implement Magic Dictionary
Implement a magic directory with buildDict, and search methods.For the method buildDict, you'll be given a list of non-repetitive words to build a dictionary.For the method search, you'll be g原创 2017-09-10 11:04:04 · 916 阅读 · 0 评论 -
648. Replace Words
In English, we have a concept called root, which can be followed by some other words to form another longer word - let's call this word successor. For example, the root an, followed by other, which ca...原创 2017-07-23 11:47:31 · 367 阅读 · 0 评论 -
440. K-th Smallest in Lexicographical Order
Given integers n and k, find the lexicographically k-th smallest integer in the range from 1 to n.Note: 1 ≤ k ≤ n ≤ 109.Example:Input:n: 13 k: 2Output:10Explanation:The lexicographical order ...原创 2018-04-09 16:05:12 · 135 阅读 · 0 评论 -
1032. Stream of Characters
Implement theStreamCheckerclass as follows:StreamChecker(words): Constructor, init the data structure with the given words. query(letter): returns true if and only if for somek >= 1, the last...原创 2019-04-21 12:05:15 · 287 阅读 · 0 评论