查找相应前缀的子节点树 @param word @return

Returns if there is any word in the trie that starts with the given prefix.

对两个节点相连。时间复杂度接近O(1)。

* Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both returned array and

访问节点标记 @param pairQueue 队列 @param visitedBeginMap 头部访问记录 @param visitedEndMap 尾部访问记录 @return

** Initialize your data structure here. */

** Initialize your data structure here. */

** Initialize your data structure here. Set the size of the deque to be k. */

** Initialize your data structure here. Set the size of the deque to be k. */

** Initialize your data structure here. Set the size of the deque to be k. */

** Deletes an item from the front of Deque. Return true if the operation is successful. */

** Deletes an item from the rear of Deque. Return true if the operation is successful. */

** Deletes an item from the rear of Deque. Return true if the operation is successful. */

** Deletes an item from the rear of Deque. Return true if the operation is successful. */

** Get the front item from the deque. */

** Get the last item from the deque. */

** Get the last item from the deque. */

** Inserts a word into the trie. */

** Adds an item at the rear of Deque. Return true if the operation is successful. */

Checks whether the circular deque is empty or not. */

生成头结点

NewUnionSet function create UnionSet

** Returns if the word is in the trie. */

** Returns if the word is in the trie. */

** Returns if there is any word in the trie that starts with the given prefix. */

合并两个集合*/