字符串匹配算法.pdfVIP

字符串算法总结： ===================================================================== 朴素字符串匹配 int match (char *s, char *t) { int ls = strlen(s), lt = strlen(t), ids = 0, idt = 0; while (idsls idtlt) { if (s[ids] == t[idt]) ids++, idt++; else { ids -= idt - 1; idt = 0; } } if (idt == lt) return ids - lt; return -1; } ===================================================================== kmp 算法 void getNxt (char *t, int *nxt) { int i = 0, j = -1, l = strlen(t); nxt[0] = -1; while (i l) if (j==-1 || t[i] == t[j]) { i++, j++; if(t[i] != t[j]) nxt[i] = j; else nxt[i] = nxt[j]; } else j = nxt[j]; } //s为文本串，t 为模式串，s 中找t int kmp (char *s, char *t) { int ls = strlen(s), lt = strlen(t); if (ls lt) return -1; int nxt[mx]; getNxt(t, nxt); int i = 0, j = 0; while (ils jlt) if (j==-1 || s[i]==t[j]) i++, j++; else j = nxt[j]; if (j = lt) return i - lt; return -1; } ===================================================================== 扩展kmp 算法 //s为文本串，t 为模式串 LCP （Longest Common Prefix） //nxt[i]：t 中以第i 位开始的后缀与整串的lcp，extend[i]:s 中第i 位开始的后缀与t 的lcp char s[MX], t[MX]; int nxt[MX], extend[MX]; void getExtendNext (const char *t, const int lt, int *nxt) { for (int i = 1, j = -1, a, p; i lt; i++, j--) if (j 0 || i + nxt[i - a] = p) { if (j 0) j = 0, p = i; while (p lt t[j] == t[p]) j++, p++; nxt[i] = j, a = i; } else nxt[i] = nxt[i - a]; } void getExtend (const char *s, const int ls, const char *t, const int lt, int *extend, int *nxt) { getExtendNext(t, lt, nxt); for (int i = 0, j = -1, a, p; i ls; i++, j--) if (j 0 || i + nxt[i - a] = p) { if (j 0) j =