题目
原文:
Given a string s and an array of smaller strings T, design a method to search s for each small string in T.
译文:
给一个字符串S和一个小一点的字符串数组T,设计一个方法去在S中搜索T中的字符串。
解答
(ctci解法)首先我们创建一个后缀树s,例如如果你的单词是“bibs”,你将创建下面的树:
然后所有我们需要做的是搜索每个在T的后缀树的字符串,注意如果“B”是一个单词,你将想出两条路径。代码如下:
import java.util.*;
class Q20_8{
public static void main(String[] args) {
String testString = "mississippi";
String[] stringList = {"is", "sip", "hi", "sis"};
SuffixTree tree = new SuffixTree(testString);
for (String s : stringList) {
ArrayList<Integer> list = tree.getIndexes(s);
if (list != null) {
System.out.println(s + ":" + list.toString());
}
}
}
}
class SuffixTree {
SuffixTreeNode root = new SuffixTreeNode();
public SuffixTree(String s) {
for (int i = 0; i < s.length(); i++) {
String suffix = s.substring(i);
root.insertString(suffix, i);
}
}
public ArrayList<Integer> getIndexes(String s) {
return root.getIndexes(s);
}
}
class SuffixTreeNode {
HashMap<Character, SuffixTreeNode> children = new
HashMap<Character, SuffixTreeNode>();
char value;
ArrayList<Integer> indexes = new ArrayList<Integer>();
public SuffixTreeNode() { }
public void insertString(String s, int index) {
indexes.add(index);
if (s != null && s.length() > 0) {
value = s.charAt(0);
SuffixTreeNode child = null;
if (children.containsKey(value)) {
child = children.get(value);
} else {
child = new SuffixTreeNode();
children.put(value, child);
}
String remainder = s.substring(1);
child.insertString(remainder, index);
}
}
public ArrayList<Integer> getIndexes(String s) {
if (s == null || s.length() == 0) {
return indexes;
} else {
char first = s.charAt(0);
if (children.containsKey(first)) {
String remainder = s.substring(1);
return children.get(first).getIndexes(remainder);
}
}
return null;
}
}
详细的解法可参考hawstein大神的
---EOF---