最近这两天学了学有关字符串匹配的算法,据说字符串匹配问题是计算机科学领域中研究最为广泛的问题之一,用于信息类的领域...反正有关字符串的东西确实很重要,比如想从事大数据,自然语言处理,人工智能,机器学习等方面工作的童鞋来说,这些基本的有关字符串的算法必会噢,同时有关字符串的算法,题目,应用来说,确实体现智慧啊(有的比较不太好理解,生涩难懂)
好了,闲话就哔哔到这,上干货...
首先作为基础暴力匹配的算法是必须熟的,BF算法,这个没啥说的直接给代码了...
int brute_force(char *buffer, char *pattern) {
int len1 = strlen(buffer);
int len2 = strlen(pattern);
for (int i = 0; i <= (len1 - len2); i++) {
int j;
for (j = 0; j < len2; j++) {
if (buffer[i + j] != pattern[j]) {
break;
}
}
if (j == len2) return i;
}
return -1;
}
kmp
void get_next(char *pattern, int *next) {
next[0] = -1;
for (int i = 1, match = -1; pattern[i]; i++) {
while (match >= 0 && pattern[match + 1] != pattern[i]) {
match = next[match];
}
if (pattern[match + 1] == pattern[i]) {
match += 1;
}
next[i] = match;
}
}
int kmp(char *buffer, char *pattern, int *next) {
for(int i = 0, match = -1; i < strlen(buffer); i++) {
while (match >= 0 && pattern[match + 1] != buffer[i]) {
match = next[match];
}
if (pattern[match + 1] == buffer[i]) {
match += 1;
}
if (match == strlen(pattern) - 1) {
return i - match;
}
}
return -1;
}