Leetcode之 Implement Trie (Prefix Tree)

题目：

Implement a trie with insert, search, and startsWith methods.

Example:

Trie trie = new Trie();

trie.insert("apple");
trie.search("apple");   // returns true
trie.search("app");     // returns false
trie.startsWith("app"); // returns true
trie.insert("app");   
trie.search("app");     // returns true

Note:

• You may assume that all inputs are consist of lowercase letters a-z.
• All inputs are guaranteed to be non-empty strings.

代码：

class Trie {
public:
	char value;
	Trie* t[26];
	bool endflag = false;
	/** Initialize your data structure here. */
	Trie() {
		value = '.';
		for (int i = 0; i < 26; i++) {
			t[i] = NULL;
		}
	}

	/** Inserts a word into the trie. */
	void insert(string word) {

		int len = word.length();
		Trie** v = t;
		for (int i = 0; i < len; i++) {
			int temp = word[i] - 'a';
			if (v[temp] == NULL) {
				v[temp] = new Trie();
				v[temp]->value = word[i];
			}
			if (i == len - 1)v[temp]->endflag = true;
			v = v[temp]->t;
		}
	}

	/** Returns if the word is in the trie. */
	bool search(string word) {

		int len = word.length();
		Trie** v = t;
		for (int i = 0; i < len; i++) {
			int temp = word[i] - 'a';
			if (v[temp] == NULL)return false;
			if (i == len - 1 && !v[temp]->endflag)return false;
			v = v[temp]->t;
		}
		return true;
	}

	/** Returns if there is any word in the trie that starts with the given prefix. */
	bool startsWith(string prefix) {
		int len = prefix.length();
		Trie** v = t;
		for (int i = 0; i < len; i++) {
			int temp = prefix[i] - 'a';
			if (v[temp] == NULL)return false;
			v = v[temp]->t;
		}
		return true;
	}
};

/**
 * 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);
 */