Cracking the Coding Interview - Fooo

Solutions to Chapter 20 | Hard
20 public SuffixTreeNode() { }
21
22 public void insertString(String s, int index) {
23 indexes.add(index);
24 if (s != null && s.length() > 0) {
25 value = s.charAt(0);
26 SuffixTreeNode child = null;
27 if (children.containsKey(value)) {
28 child = children.get(value);
29 } else {
30 child = new SuffixTreeNode();
31 children.put(value, child);
32 }
33 String remainder = s.substring(1);
34 child.insertString(remainder, index);
35 }
36 }
37
38 public ArrayList getIndexes(String s) {
39 if (s == null || s.length() == 0) {
40 return indexes;
41 } else {
42 char first = s.charAt(0);
43 if (children.containsKey(first)) {
44 String remainder = s.substring(1);
45 return children.get(first).getIndexes(remainder);
46 }
47 }
48 return null;
49 }
50 }
51
52 public class Question {
53 public static void main(String[] args) {
54 String testString = “mississippi”;
55 String[] stringList = {“is”, “sip”, “hi”, “sis”};
56 SuffixTree tree = new SuffixTree(testString);
57 for (String s : stringList) {
58 ArrayList list = tree.getIndexes(s);
59 if (list != null) {
60 System.out.println(s + “: “ + list.toString());
61 }
62 }
63 }
64 }
2 8 9
Cracking the Coding Interview | Additional Review Problems