实现KMP算法，输入三组主串S和模式串P，输出模式串的Next(j)函数值，以及该P在S中的位置的定位函数值，即序号值。其中S的长度为15~25,P的长度为5~8。-KMP algorithm implementation, the input string S and the three main pattern string P, the output mode string Next (j) function values, and the P' s position in the

字符串匹配问题，最经典的KMP算法。p为模式串，t为主串。返回的是最大匹配数-String matching problem, the most classic of KMP algorithm. p is the pattern string, t the main string. Back is the maximum number of matches

algorithm kmp in c# EXTENDED