Leetcode208 实现 Trie (前缀树)

实现一个 Trie (前缀树)，包含 insert, search, 和 startsWith 这三个操作。

示例:

Trie trie = new Trie();

trie.insert(“apple”); trie.search(“apple”); // 返回 true
trie.search(“app”); // 返回 false trie.startsWith(“app”); // 返回 true
trie.insert(“app”); trie.search(“app”); // 返回 true 说明:

你可以假设所有的输入都是由小写字母 a-z 构成的。 保证所有输入均为非空字符串。

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/implement-trie-prefix-tree
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

map实现，效率不高，140ms

class Trie {
public:
	/** Initialize your data structure here. */
	Trie() {
		root = new Node();
	}

	/** Inserts a word into the trie. */
	void insert(string word) {
		Node* cur = root;
		for (char c : word) {
			if (cur->next->count(c) == 0) {
				cur->next->insert(make_pair(c, new Node()));
			}
			cur = cur->next->at(c);
		}
		if (!cur->isWord) {
			cur->isWord = true;
		}
	}

	/** Returns if the word is in the trie. */
	bool search(string word) {
		Node* cur = root;
		for (char c : word) {
			if (cur->next->count(c) == 0) {
				return false;
			}
			cur = cur->next->at(c);
		}
		return cur->isWord; 
	}

	/** Returns if there is any word in the trie that starts with the given prefix. */
	bool startsWith(string prefix) {
		Node* cur = root;
		for (char c : prefix) {
			if (cur->next->count(c) == 0) {
				return false;
			}
			cur = cur->next->at(c);
		}
		return true;
	}

	class Node {
	public:
		bool isWord;
		map<char, Node*>* next;
		Node(bool isWord) {
			this->isWord = isWord;
			next = new map<char, Node*>();
		}
		Node() {
			this->isWord = false;
			next = new map<char, Node*>();
		}
	};
private:
	Node* root;
};

/**
* Your Trie object will be instantiated and called as such:
* Trie* obj = new Trie();
* obj->insert(word);
* bool param_2 = obj->search(word);
* bool param_3 = obj->startsWith(prefix);
*/