数据结构课件总结.pptVIP

* 3 c 6 2 2 1 1 0 next函数值 b a a b a 模式串 5 4 3 2 1 j ? a b c b a a ? next chdata succ 结点结构: 4.28 链表结构的串的 next 函数 void get_next(char T[], int next[]) { k = -1; j = 0; next[0] = -1; while ( T[j+1] != ?\0?) { if ( k = = -1 || T[j] ==T[k] ) { ++j; ++k; next[j] = k; } else k = next[k]; } } // get_next q=T.head; p=q-succ; p-next=q; ( p-succ!=NULL ) { p=p-succ; q=q-succ; p-next=q; } q=q-next; ( q==T.head || p-chdata == q-chdata ) k = -1; j = 0; next[0] = -1; ( T[j+1] != ?\0?) ( k = = -1 || T[j] ==T[k] ) { ++j; ++k; next[j