添加了汲取相关词汇的办法

azhoulinux · azhoulinux · commit 8a3e87ea7df8 · 2013-07-30T12:14:30.000+08:00
diff --git a/java/CharTree.java b/java/CharTree.java
@@ -1,10 +1,16 @@
 package test_jcseg;
 
+import java.util.ArrayList;
 import java.util.Arrays;
 import java.util.Comparator;
+import java.util.List;
 
 public class Test {
 
+	private static final CharNode NOT_CONTAIN_NODE = new CharNode(' ', null);
+	private static final CharNode CONTAIN_BUT_NOT_WORD_NODE = new CharNode(' ',
+			null);
+
 	public static void main(String[] args) {
 		CharTree charTree = new CharTree();
 		charTree.appendWord("abc");
@@ -13,6 +19,9 @@ public static void main(String[] args) {
 		System.out.println(charTree.containWord("abc"));
 		System.out.println(charTree.containWord("abd"));
 		System.out.println(charTree.containWord("ab"));
+		for (String str : charTree.listContainWords("feoejfoabcjfelfjlabd")) {
+			System.out.println(str);
+		}
 	}
 
 	public static class CharTree {
@@ -22,6 +31,24 @@ public static class CharTree {
 		public CharTree() {
 		}
 
+		public List<String> listContainWords(String str) {
+			List<String> wordList = new ArrayList<String>();
+			char[] charArray = str.toCharArray();
+			for (int i = 0; i < charArray.length; i++) {
+				for (int j = i + 1; j <= charArray.length; j++) {
+					String substring = str.substring(i, j);
+					ContainResult containResult = this.containWord(substring);
+					if (containResult.equals(ContainResult.NOT_CONTAIN)) {
+						break;
+					}
+					if (containResult.equals(ContainResult.CONTAIN)) {
+						wordList.add(substring);
+					}
+				}
+			}
+			return wordList;
+		}
+
 		public void appendWord(String word) {
 			CharNode currentCharNode = root;
 			char[] charArray = word.toCharArray();
@@ -67,7 +94,7 @@ public int compare(CharNode o1, CharNode o2) {
 			return currentCharNode.getCharNodes()[index];
 		}
 
-		public boolean containWord(String word) {
+		public ContainResult containWord(String word) {
 			CharNode currentCharNode = root;
 			char[] charArray = word.toCharArray();
 			for (int i = 0; i < charArray.length; i++) {
@@ -77,31 +104,41 @@ public boolean containWord(String word) {
 					isWord = true;
 				}
 				currentCharNode = containCharNode(currentCharNode, c, isWord);
-				if (currentCharNode == null) {
-					return false;
+				if (currentCharNode == NOT_CONTAIN_NODE) {
+					return ContainResult.NOT_CONTAIN;
+				} else if (currentCharNode == CONTAIN_BUT_NOT_WORD_NODE) {
+					return ContainResult.CONTAIN_BUT_NOT_WORD;
 				}
 			}
-			return true;
+			return ContainResult.CONTAIN;
 		}
 
 		private CharNode containCharNode(CharNode currentCharNode, char c,
 				boolean isWord) {
 			CharNode[] charNodes = currentCharNode.getCharNodes();
 			CharNode childCharNode = new CharNode(c, null);
+			if (charNodes == null || charNodes.length == 0) {
+				return NOT_CONTAIN_NODE;
+			}
 			int index = Arrays.binarySearch(charNodes, childCharNode);
 			if (index >= 0) {
-				if (isWord){
-					if(charNodes[index].isWord) {
+				if (isWord) {
+					if (charNodes[index].isWord) {
 						return charNodes[index];
 					}
-					return null;
+					return CONTAIN_BUT_NOT_WORD_NODE;
 				}
 				return charNodes[index];
 			}
-			return null;
+			return NOT_CONTAIN_NODE;
 		}
 	}
 
+	public static enum ContainResult {
+
+		CONTAIN, NOT_CONTAIN, CONTAIN_BUT_NOT_WORD,
+	}
+
 	public static class CharNode implements Comparable<CharNode> {
 
 		private char c;
