随笔分类 -  Trie

摘要:class Solution { class Trie{ public Trie[] children=new Trie[26]; public boolean isWord=false; public boolean added=false; public void insert(String word) { ... 阅读全文
posted @ 2017-11-07 07:32 Weiyu Wang 阅读(178) 评论(0) 推荐(0)
摘要:class WordDictionary { private WordDictionary[] children=new WordDictionary[26]; boolean isWord=false; /** Initialize your data structure here. */ public WordDictionary() {... 阅读全文
posted @ 2017-11-07 06:47 Weiyu Wang 阅读(114) 评论(0) 推荐(0)
摘要:class Trie { Trie[] children=new Trie[26]; boolean isWord=false; /** Initialize your data structure here. */ public Trie() { } /** Inserts a word into... 阅读全文
posted @ 2017-11-07 02:32 Weiyu Wang 阅读(106) 评论(0) 推荐(0)
摘要:Time Limit: 5000MSMemory Limit: 128000KTotal Submissions: 13696Accepted: 3384DescriptionYou are given a bunch of wooden sticks. Each endpoint of each stick is colored with some color. Is it possible t... 阅读全文
posted @ 2009-10-10 03:53 Weiyu Wang 阅读(789) 评论(0) 推荐(0)