Tri树（字典树JAVA版）联想输入法所用的数据结构

最新推荐文章于 2022-01-23 11:33:23 发布

diaman

最新推荐文章于 2022-01-23 11:33:23 发布

阅读量1.3k

点赞数

分类专栏： java技术类文章标签：输入法联想 java iterator string file

java技术类专栏收录该内容

3 篇文章 0 订阅

订阅专栏

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.Iterator;
import java.util.List;
import java.util.Scanner;

public class TriTree {
public static void insert(TriNode root, String str) {

boolean end, find;
TriNode node = null;
for (int i = 0; i < str.length(); i++) {
   end = false;
   find = false;
   List<TriNode> triLink = root.triLink;
   if (i == (str.length() - 1))
    end = true;
   char ch = str.charAt(i);
   Iterator<TriNode> iterator = triLink.iterator();

   while (iterator.hasNext()) {
    node = iterator.next();
    if (node.ch == ch) {
     find = true;
     break;
    }

}
if (find)

root = node;

   else {
    TriNode tri_node = new TriNode(ch);
    triLink.add(tri_node);
    root = tri_node;
   }
   if (end)
    root.count++;
}
}

public static TriNode creat_TriTree(String fileName) {
File file = new File(fileName);
TriNode root = new TriNode();
try {
   BufferedReader bf = new BufferedReader(new FileReader(file));
   try {
    String str = bf.readLine();
    while (str != null) {
     insert(root, str);
     str = bf.readLine();
    }

   } catch (IOException e) {
    e.printStackTrace();
   } finally {
    bf.close();
   }

} catch (FileNotFoundException e) {
   System.err.println("can't find the file in the location");
   e.printStackTrace();
} catch (IOException e) {
   e.printStackTrace();
}
return root;
}

public static void traverse(TriNode root) {
char[] array = new char[20];
visit(array, 0, root.triLink.iterator(), 0);
}

public static void visit(char[] array, int len, Iterator<TriNode> iterator,
   int count) {
if (!iterator.hasNext()) {
   for (int i = 0; i < len; i++)
    System.out.print(array[i]);
   System.out.print(count);
   System.out.println();
} else {
   while (iterator.hasNext()) {
    TriNode node = iterator.next();
    array[len++] = node.ch;
    visit(array, len, node.triLink.iterator(), node.count);
    len--;

}
}
}

public static void hintSearch(TriNode root) {
Scanner in = new Scanner(System.in);
System.out.println("enter the word give the tip");
while (in.hasNext()) {
   String str = in.nextLine();
   TriNode node = null;
   boolean find;
   for (int i = 0; i < str.length(); i++) {
    find = false;
    char ch = str.charAt(i);
    List<TriNode> triLink = root.triLink;
    Iterator<TriNode> iterator = triLink.iterator();
    while (iterator.hasNext()) {
     node = iterator.next();
     if (node.ch == ch)
      {
      find=true;
      break;
      }
    }
    if (find)
     root = node;
    }
   traverse(root);//需要加一些小小的改进很简单自己动手

}
}
}

TriNode/

import java.util.LinkedList;

public class TriNode {
public int count=0;
public LinkedList<TriNode> triLink;
public char ch;
public TriNode(char ch)
{
this.ch=ch;
triLink=new LinkedList<TriNode>();
}
public TriNode()
{
triLink=new LinkedList<TriNode>();
}

}

本文来自CSDN博客，转载请标明出处：http://blog.csdn.net/Athenaer/archive/2010/03/16/5381864.aspx