方法:利用KMP算法,将两个树进行序列化,分别遍历一遍树,得到两个字符串,时间复杂度是O(n)
KMP问题:
String1,String2,如果String2为String1的子串,则返回String2在String1中的开始位置
public static int getIndexOf(String s, String m){
if(s == null || m == null || m.length() < 1 || s.length() < m.length()){
return -1;
}
char[] ss = s.toCharArray();
char[] ms = m.toCharArray();
int si = 0;
int mi = 0;
int[] next = getNextArray(ms);
while(si < ss.length && mi < ms.length){
if(ss[si] == ms[mi]){
si++;
mi++;
}else if(next[mi] == -1){
si++;
}else{
mi = next[mi];
}
}
return mi == ms.length ? si - mi : -1;
}
public static int[] getNextArray(char[] ms){
if(ms.length == 1){
return new int[] {-1};
}
int[] next = new int[ms.length];
next[0] = -1;
next[1] = 0;
int pos = 2;
int cn = 0;
while(pos < next.length){
if(ms[pos - 1] == ms[cn]){
next[pos++] = ++cn;
}else if (cn > 0){
cn = next[cn];
}else{
next[pos++] = 0;
}
}
return next;
}