c___c18的博客

浏览过很多的博客，发现主要有两种的求next数组的方法： 第一种：F数组（也就是next数组）表示到第i个字符所构成的最长前后缀的长度减一，这样得到的next数组里面的数也是模板串的下标。 int main() { char B[100]; gets(B); int m=strlen(B); int F[100]={-1}; for (int ...

Power Strings  POJ - 2406  Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplicat...

Cyclic Nacklace HDU - 3746 CC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there are only 99.9 yuan left. he is too distresse...

string matching String matching is a common type of problem in computer science. One string matching problem is as following: Given a string s[0…len−1], please calculate the length of the longest comm...