bitmyron的博客

1 void makeNext(const char P[],int next[]) 2 { 3 int q,k;//q:模版字符串下标；k:最大前后缀长度 4 int m = strlen(P);//模版字符串长度 5 next[0] = 0;//模版字符串的第一个字符的最大前后缀长度为0 6 for (q = 1,k = 0; q //for循环，从第

DP即Dynamic Programming，按照wiki上面的解释，dynamic programming (also known as dynamic optimization) is a method for solving a complex problem by breaking it down into a collection of simpler subproblems,