2016年5月30日
208. Implement Trie (Prefix Tree) && 211. Add and Search Word - Data structure design
摘要： Implement a trie with insert, search, and startsWith methods. Note:You may assume that all inputs are consist of lowercase letters a-z. Subscribe to s 阅读全文
posted @ 2016-05-30 08:19 新一代的天皇巨星 阅读(178) 评论(0) 推荐(0)
173. Binary Search Tree Iterator
摘要： Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST. Calling next() will return the n 阅读全文
posted @ 2016-05-30 07:52 新一代的天皇巨星 阅读(107) 评论(0) 推荐(0)