stringsearch

说明：  S和T分别是具有m个和n个字符的顺序存储的串，在S和T中寻找最大公共子串。
(S and T, respectively, with m and n of the order of characters stored in string, in the S and T to find the largest common sub-string.)