https://wiki.ta.in.th/index.php?action=history&feed=atom&title=Knuth-Morris-Pratt_%28KMP%29 2026-06-16T23:29:19Z Revision history for this page on the wiki MediaWiki 1.33.0-alpha https://wiki.ta.in.th/index.php?title=Knuth-Morris-Pratt_(KMP)&diff=94&oldid=prev 2019-03-07T17:14:28Z

<p>Created page with &quot;อันนี้เป็น snippet ที่ copy มาจาก http://www.cprogramming.com/snippets/source-code/knuthmorrispratt-kmp-string-search-algorithm เห็...&quot;</p> <p><b>New page</b></p><div>อันนี้เป็น snippet ที่ copy มาจาก http://www.cprogramming.com/snippets/source-code/knuthmorrispratt-kmp-string-search-algorithm<br /> เห็นว่า string matching เรียนใน สอวน. ค่าย 2<br /> <br /> const char *kmp_search(const char *text, const char *pattern)<br /> {<br /> int *T;<br /> int i, j;<br /> const char *result = NULL;<br /> <br /> if (pattern[0] == '\0')<br /> return text;<br /> <br /> /* Construct the lookup table */<br /> T = (int*) malloc((strlen(pattern)+1) * sizeof(int) );<br /> T[0] = -1;<br /> for (i=0; pattern[i] != '\0'; i++) {<br /> T[i+1] = T[i] + 1;<br /> while (T[i+1] &gt; 0 &amp;&amp; pattern[i] != pattern[T[i+1]-1])<br /> T[i+1] = T[T[i+1]-1] + 1;<br /> }<br /> <br /> /* Perform the search */<br /> for (i=j=0; text[i] != '\0'; ) {<br /> if (j &lt; 0 || text[i] == pattern[j]) {<br /> ++i, ++j;<br /> if (pattern[j] == '\0') {<br /> result = text+i-j;<br /> break;<br /> }<br /> }<br /> else j = T[j];<br /> }<br /> <br /> free(T);<br /> return result;<br /> }</div>

Tata