字符串匹配算法（String matching algorithm）.docVIP

字符串匹配算法（String matching algorithm） The brute force method, Horspool, Boyer-Moore, Knuth-Morris-Pratt algorithm is used for the performance of different languages, the scale of data on them. The scale of the data should be above 100000. Int BruteForceStringMatch (string STR, string pattern) { For (int i = 0; I = (str.size) - pattern.size (i++);) { Int j = 0; ((while) (J pattern.size) (pattern[j] = = str[i+j])) { J++; } If (J) = (pattern.size) Return i; } Return (-1); } Void ShiftTable (string pattern, int table[], Int l) { For (int i = 0; I 127; i++) Table[i] = l; For (int j = 0; J L-1; j++) Table[pattern[j]] = l-1-j; } Void HorspoolMatch (string STR, int table[], string pSize) Int (main) { String a = abcdefg; String mode = z; CoutBruteForceStringMatch (a, mode) endl; Return 0; } #includeiostream Using namespace std; Const int HASH_SIZE=256; Int table[HASH_SIZE]; / / the corresponding character table of 255 characters to build a hash table, said does not match the character to the right moving distance Void ShiftTable (char pattern[]) { * to establish a alphabet characters index Table array * Int m=strlen (pattern); For (int i=0; iHASH_SIZE; i++) Table[i]=m; For (int j=0; jm-1; j++) Table[pattern[j]]=m-1-j; } Int HorspoolMatching (char pattern[], char text[]) {// average efficiency of O (n) * Pre: pattern, text text Post: the first matching string the leftmost character string matching without subscript, return -1 find * / ShiftTable (pattern); Int m=strlen (pattern); Int n=strlen (text); Int i=m-1; While (I n-1) { Int k=0; / / the number of characters, While (k=m-1 pattern[m-1-k] = = text[i-k]) K++; If (k==m) Return i-m+1; Else I=i+table[text[i]]; / / to the last character to determine the moving distance, the biggest difference with the B.M algorithm, a simplified form } Return -1; } Int (main) { Char p[20], t[1000]; While (cint T! = {.) Int times=5; 而（次）{ CIN P； cout horspoolmatching（P，T） endl； } } 返回1； } #包含iostream #算法包括 #包括字符串 #包括向量 #则ssize_t off_