朴素模式匹配(BF)

public class BF_Match {
public static int match1(String txt,String pat,int offset[]){
int i,j,c=0;
char[] txt2=txt.toCharArray();
char[] pat2=pat.toCharArray();
int m = txt2.length;
int n = pat2.length;
for(i=0;i<=m-n;i++){
for(j=0;j<n;j++){
if(txt2[i+j]!=pat2[j])
break;
if(j==n-1)
offset[c++]=i;
}
}
return c;
}
public static int match2(String txt,String pat,int offset[]){
char[] txt2=txt.toCharArray();
char[] pat2=pat.toCharArray();
int m = txt2.length;
int n = pat2.length;
int i=0;
int j=0;
int c=0;
while(i<m&&j<n){
if(txt2[i]==pat2[j]){
i++;j++;
}else{
i=i-j+1;//
j=0;
}
if(j>=n){//实际j==n
offset[c++]=i-j;
i=i-j+1;
j=0;
}
}
return c;
}
public static void main(String[] args) {
String str1="abcefgefghjefgjjk";
String str2="efg";
int offset[] = new int[11];
int c = match2(str1,str2,offset);
System.out.println(c+"--"+offset[0]+"--"+offset[1]+"--"+offset[2]);
}


}