说明: void KMP(char* T, char* P){ int i, n, m, k; n = strlen(T); m = strlen(P); for(k = -1, i = 0; i -1 && P[k+1] != T[i]) k = pre[k]; if(P[k+1] == T[i]) k++; if(k == m-1){ cout << "Pattern occurs with shift " << i - m + 2 << endl; k =
<kwwxxx> 上传 | 大小:336kb