String Matching
Page 1 of 1
String Matching
Brute Force:
public static int match(String a, String b){
char[] cha=a.toCharArray();
char[] chb=b.toCharArray();
int m=a.length();
int n= b.length();
for(int i=0;i<n-m;i++){
for(int j=0;j<m;j++){
if(cha[i+j]!=cha[j])
continue nexti;
}
return i;
}
return -1;
}
public static int match(String a, String b){
char[] cha=a.toCharArray();
char[] chb=b.toCharArray();
int m=a.length();
int n= b.length();
for(int i=0;i<n-m;i++){
for(int j=0;j<m;j++){
if(cha[i+j]!=cha[j])
continue nexti;
}
return i;
}
return -1;
}
Similar topics
» String Matching KMP
» Reverse a String
» Find duplicate words in a string
» Reverse words in a string
» Combinations of a String/Array
» Reverse a String
» Find duplicate words in a string
» Reverse words in a string
» Combinations of a String/Array
Page 1 of 1
Permissions in this forum:
You cannot reply to topics in this forum