字典树trie学习

字典树trie的思想就是利用节点来记录单词，这样重复的单词可以很快速统计，单词也可以快速的索引。缺点是内存消耗大

http://blog.csdn.net/chenleixing/article/details/44708533  这个是学习资料来源。

附上个人代码实践操作

package ShuJujieGou;

import javax.swing.tree.TreeNode;

public class Tries {
    private int deepLength;
    private int nodeNumber;
    private final int SIZE = 26;
    private treeNode root;

    public Tries() {
        deepLength = 0;
        nodeNumber = 0;
        root = new treeNode();
    }

    private class treeNode {
        public int passNumeber;// 从这里进过的节点单词数量
        private int endNumber;// 相同单词有几个
        private boolean isEnd;// 是否结束
        private treeNode[] son;
        private char word;

        public treeNode() {
            this.passNumeber = 0;
            this.endNumber = 0;
            this.isEnd = false;
            son = new treeNode[SIZE];
        }
    }

    private boolean isWord(String str) {
        if (str == null || !str.matches("[0-9a-zA-Z]*")) {
            return false;
        }
        return true;
    }

    public void insertWord(String str) {

        if (!isWord(str)) {
            System.out.println("请输入正确字符");
            return;
        }
        treeNode node = this.root;
        String s = str.toLowerCase();
        char[] word = s.toCharArray();
        for (char c : word) {
            int cn = c - 'a';
            if (node.son[cn] == null) {
                node.son[cn] = new treeNode();
                node=node.son[cn];
                node.word = c;
                this.nodeNumber++;
                node.passNumeber=1;
            } else {
                node = node.son[cn];
                node.passNumeber++;
            }

        }
        node.isEnd = true;
        node.endNumber++;
        if (this.deepLength < word.length) {
            this.deepLength = word.length;
        }
    }

    public void sayMyself() {
        System.out.println("length:" + this.deepLength);
        System.out.println("nodenumber:" + this.nodeNumber);
    }

    public void getWord(treeNode node,String str){

        for (int x=0;x<SIZE;x++){
            if(!(node.son[x]==null)){
            String s= str+node.son[x].word;
                getWord(node.son[x],s);
                if(node.son[x].isEnd){
                    System.out.println("单词:"+s);
                }
            }
        }

    }
    public void getAllWord(){//这里添加上面文章没有的把所有单词全部索引出来
        String s = "";
        getWord(root,s);
    }

}

//测试代码
package ShuJujieGou;

public class Test {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
    Tries tree = new Tries();
    tree.insertWord("car");
    tree.insertWord("bus");
    tree.insertWord("chicken");
    tree.insertWord("cook");
    tree.insertWord("rock");
    tree.insertWord("hard");
    tree.insertWord("good");
    tree.insertWord("bad");

    tree.sayMyself();
    tree.getAllWord();
    }

}
/*
输出
length:7
nodenumber:29
单词:bad
单词:bus
单词:car
单词:chicken
单词:cook
单词:good
单词:hard
单词:rock
*/