字符串模式匹配算法研究论文

#includeusing namespace std;void Next(char T[],int next[]){ next[0]=-1; int j=0,k=-1; while(T[j]!='\0') if((k==-1)||(T[j]==T[k])) { j++; k++; next[j]=k; } else k=next[k];}int KMP(char S[],char T[]){ int i=0,j=0; int next[10]; Next(T,next); while((S[i]!='\0')&&(T[j]!='\0')) { if(S[i]==T[j]) {i++;j++;} else j=next[j]; if(j==-1) { i++;j++; } } if(T[j]=='\0') return(i-j+1); else return 0;}int main(){ char a[100],b[100]; cout<<"please enter primary string :"; cin.getline(a,100); cout<<"please enter substring:"; cin.getline(b,100); if(KMP(a,b)==0) cout<<"not exist!\n"; else cout<<"location is:"<

#include using namespace std;string s = "zabcdefg";int index1(const string ss, int pos){ if (pos<0 || pos>s.length()) printf("pos²»ºÏ·¨£¡"); int i = pos, j = 0; while (i < s.length() && j < ss.length()) { if (s[i]==ss[j]) { i++; j++; } else { i=i-j+1; j=0; } } if (j>=ss.length()) return (i-j+1); else return -1;}void getnext(const string ss, int *next){ int i = 0, j = -1; next[i] = -1; while (i < ss.length()) { if (j == -1 || s[i] == ss[j]) { i++; j++; next[i]=j; } else j = next[j]; }}int index2(const string ss, int pos){ int *next = new int[ss.length()]; getnext(ss, next); int i = pos, j = 0; while (i < s.length() && j < ss.length()) { if (j==0 || s[i]==ss[j] ) { ++i; ++j; } else { j = next[j]; } }if (j >= ss.length()) return i-ss.length()+1; else return -1;}int main(){ string ss = "abc"; printf("index1: %d, index2: %d\n", index1(ss, 0), index2(ss, 0)); return 0;}

恩,百度提问太差了 我都丢了几次高分都没有成功!我估计丢了500分了不是乱答就是没通过,分又没有