杭电-Substrings-Java代码

import java.util.*;
public class Main{
public static void main(String[] args) {
	Scanner sc = new Scanner(System.in);
	int t = sc.nextInt();
	while (t != 0) {
		int n = sc.nextInt();
		String[] arr = new String[n];
		int min = 101;
		String result = null;// 存储输入的字符串中长度最小的串
		for (int i = 0; i < arr.length; i++) {
			arr[i] = sc.next();
			if (min > arr[i].length()) {
				min = arr[i].length();
				result = arr[i];
			}
		}
		ArrayList<String> list = sonString(result);// 求长度最小的串的所有子串
		ArrayList<String> newlist = new ArrayList<String>();// 存储满足情况的子串
		Iterator<String> it = list.iterator();// 获取list迭代器
		while (it.hasNext()) {// 遍历list
			String s = it.next();// 获取每一个子串
			String res = new StringBuffer(s).reverse().toString();// 获取每一个子串的反串
			loop: for (int i = 0; i < arr.length; i++) {// 遍历，判断，添加
				if (!arr[i].contains(s) && !(arr[i].contains(res))) {
					break loop;
				} else if ((arr[i].contains(s) && i == arr.length - 1)
						|| (i == arr.length - 1 && (arr[i].contains(res)))) {
					newlist.add(s);
				} else if (arr[i].contains(s) || (arr[i].contains(res))) {
					continue;
				}
			}

		}
		if (newlist.size() == 0) {// 如果集合中没有元素，就输出0
			System.out.println(0);
		} else if (newlist.size() == 1) {// 如果只有一个元素，就输出这个元素的长度
			System.out.println(newlist.get(0).length());
		} else {
			ArrayList<Integer> newListLength = new ArrayList<Integer>();// 新集合用来存储newlist中每一个元素的长度
			for (int i = 0; i < newlist.size(); i++) {
				newListLength.add(newlist.get(i).length());
			}
			System.out.println(Collections.max(newListLength));// Collections.max()方法求这个集合中的最大值
		}
		t--;
	}
}

public static ArrayList<String> sonString(String s) {// 求字符串的子串
	ArrayList<String> list = new ArrayList<String>();
	for (int i = 0; i < s.length(); i++) {
		for (int j = i + 1; j <= s.length(); j++) {
			list.add(s.substring(i, j));
		}
	}
	return list;
	}
}