Trie
文章平均质量分 77
Chihyung
这个作者很懒,什么都没留下…
展开
-
208. Implement Trie (Prefix Tree)(Trie)
题目:Implement a trie with insert, search, and startsWith methods.Note:You may assume that all inputs are consist of lowercase letters a-z.实现字典树,用hashmap来存储,key为当前字符,value为子树class Tr原创 2016-09-23 15:38:06 · 178 阅读 · 0 评论 -
212. Word Search II(Trie)
题目: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原创 2016-09-23 17:04:21 · 240 阅读 · 0 评论