Leetcode 208. Implement Trie (Prefix Tree)

Question:

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

Note:
You may assume that all inputs are consist of lowercase letters a-z.

 

Answer:

 

package algorithm;

import java.util.HashMap;

class TrieNode {
	public char c;
	boolean isword = false;
	public HashMap<Character, TrieNode> children = new HashMap<Character, TrieNode>();

	// Initialize your data structure here.
	public TrieNode() {
	}

	public TrieNode(char c) {
		this.c = c;
	}
}

public class Trie {
	private TrieNode root;

	public Trie() {
		root = new TrieNode();
	}

	// Inserts a word into the trie.
	public void insert(String word) {
		if (null == word || "".equals(word))
			return;
		TrieNode cur = root;
		for (int i = 0; i < word.length(); i++) {
			char c = word.charAt(i);
			TrieNode node = cur.children.get(c);
			if (null == node) {
				node = new TrieNode(c);
				cur.children.put(c, node);
			}
			cur = node;
		}
		cur.isword = true;
	}

	// Returns if the word is in the trie.
	public boolean search(String word) {
		boolean flag = false;

		if (null == word || "".equals(word))
			return flag;

		TrieNode cur = root;
		for (int i = 0; i < word.length(); i++) {
			char c = word.charAt(i);
			if (!cur.children.containsKey(c)) {
				return flag;
			} else {
				cur = cur.children.get(c);
			}
		}
		if (cur.isword)
			flag = true;
		return flag;
	}

	// Returns if there is any word in the trie
	// that starts with the given prefix.
	public boolean startsWith(String prefix) {
		boolean flag = true;
		if (null == prefix || "".equals(prefix))
			return flag;

		TrieNode cur = root;
		for (int i = 0; i < prefix.length(); i++) {
			char c = prefix.charAt(i);
			if (!cur.children.containsKey(c)) {
				flag = false;
			} else {
				cur = cur.children.get(c);
			}
		}

		return flag;

	}

	public static void main(String[] args) {
		Trie trie = new Trie();
		trie.insert("hello");
		
		System.out.println(trie.search("hell"));
		System.out.println(trie.search("helloa"));
		System.out.println(trie.search("hello"));
		System.out.println(trie.startsWith("hell"));
		System.out.println(trie.startsWith("helloa"));
		System.out.println(trie.startsWith("hello"));
	}
}

// Your Trie object will be instantiated and called as such:
// Trie trie = new Trie();
// trie.insert("somestring");
// trie.search("key");