You are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its inverse can be found as a substring of any of the given strings. 找出最长的一个子串,所有串中都出现过它或它的逆序 扩展KMP水题 #include<stdio.h> #inc…