3616049_ac_1579ms_19508k.java

北大大牛代码 1240道题的原代码 超级权威

import java.util.*;

public class Main{
	Scanner in;
	boolean[] len = new boolean[11];
	String[] num;
	TreeSet <String> str = new TreeSet <String> ();

	public static void main(String[] args) {
		new Main().run();
	}

	private void run() {
		in = new Scanner(System.in);
		int cas, n;
		
		cas = in.nextInt();
		while (cas-- > 0) {
			n = in.nextInt();
			num = new String[n];
			Arrays.fill(len, false);
			for (int i = 0; i < n; i++) {
				num[i] = in.next();
				len[num[i].length()] = true;
			}
			str.clear();
			Arrays.sort(num);
			boolean no = false;
	label:	for (int i = 0; i < n; i++) {
				for (int j = 1; j <= num[i].length(); j++) {
					if (len[j]) {
						String tmp = num[i].substring(0, j);
						if (str.contains(tmp)) {
							no = true;
							break label;
						}
					}
				}
				str.add(num[i]);
			}
			System.out.println(no ? "NO" : "YES");
		}
	}
}