Java实现 蓝桥杯 算法提高VIP Substrings（暴力）
问题描述
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.
输入格式
The first line of the input contains a single integer t (1 <= t <= 10), the number of test cases, followed by the input data for each test case. The first line of each test case contains a single integer n (1 <= n <= 100), the number of given strings, followed by n lines, each representing one string of minimum length 1 and maximum length 100. There is no extra white space before and after a string.
输出格式
There should be one line per test case containing the length of the largest string found.
样例输入
2
3
ABCD
BCDFF
BRCD
2
rose
orchid
样例输出
2
2
试题来源
Tehran 2002 Preliminary
PS：
这道题非常感谢网易词典，规避了我致命的英语
原创文章 1868获赞 3万+访问量 618万+
关注
他的留言板
展开阅读全文
作者：南 墙
