:: ADVANCE ::

[문자열 검사] 카프-라빈 알고리즘 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899// 해시 값 함수를 이용#include char string[] = "hello my name is ksj";char input[10];int size;int strhash[30];int inputhash; int _strlen(char *str) { int size = 0; while (*(str + size) != '\0') siz..

[문자열 검사] KMP 알고리즘 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071#include char string[] = "naabcdabcdefmeaabcdabcefksj";char input[10] = "abcdabcef";int next[50];int size, stringsize; int _strlen(char *str) { int size = 0; while (*(str + size) != '\0') size++; return size;} void makenext(){ int i; next[0] = 0; ..