玩转数据结构 （第九章 Tire）

Trie 字典树 前缀树
专门处理字符串
查询每个条目的时间复杂度和条目总数无关，和所查的字符串长度有关
Trie 的局限性 空间！
代码：

import java.util.TreeMap;
public class Trie{
	private class Node{
		public boolean isWord;
		public TreeMap<Character , Node> next;
		
		public Node (boolean isWord){
			this.isWord = isWord;
			next = new TreeMap<>();
		}

		public Node(){
			this(false);
		}
	}

	private Node root;
	private int size;

	public Trie (){
		root = new Node();
		size = 0;
	}

	//获取Trie中存储的单词数量
	public int getSize(){
		return size;
	}

	//向Trie中添加一个新的单词word
	public void add(String word){
		Node cur = root;
		for (int i = 0; i < word.length(); i ++){
			char c = word.charAt(i);
			if (cur.next.get(c) == null)
				cur.next.put(c, new Node());
			cur = cur.next.get(c);
		}
		if (!cur.isWord){
			cur.isWord = true;
			size ++;
		}
	}

	// 查询单词word是否在Trie中
	public boolean contains(String word){
		Node cur = root;
		for (int i = 0; i < word.length(); i ++){
			char c = word.charAt(i);
			if (cur.next.get(c) == null){
				return false;
			}
			cur = cur.next.get(c);
		}
		return cur.isWord;
	}

	//查询是否在Trie中有单词以prefix为前缀
	public boolean isPrefix(String prefix){
		Node cur = root;
		for (int i = 0; i < prefix.length(); i ++){
			char c = prefix.charAt(i);
			if(cur.next.get(c) == null){
				return false;
			}
			cur = cur.next.get(c);
		}
		return true;
	}
}