3803316_re.java

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

package poj.p2119;

import java.util.Arrays;
import java.util.Scanner;
import java.util.TreeSet;

public class Main {

	private static TreeSet<String> ts = new TreeSet<String>();

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in;

		in = new Scanner(System.in);
		int k;

		while (true) {
			k = in.nextInt();
			if (k == 0) {
				break;
			}
			ts.clear();
			in.nextLine();
			String line = in.nextLine().toLowerCase();
			int i;
			String tmp = "";
			for (i = 0; i < line.length(); i++) {
				if (!Character.isLetter(line.charAt(i))) {
					continue;
				} else {
					if (tmp.length() < k) {
						tmp += line.charAt(i);
					} else {
						String str = sort(tmp);
						if (ts.contains(str)) {
							break;
						} else {
							ts.add(str);
							tmp = tmp.substring(1) + line.charAt(i);
						}
					}
				}
			}
			if (tmp.length() < k) {
				System.out.println(line.length());
				continue;
			}
			if (i == line.length() && ts.contains(sort(tmp))) {
				for (i = line.length() - 1; i >= 0; i--) {
					if (Character.isLetter(line.charAt(i))) {
						break;
					}
				}
			} else {
				i--;
			}
			System.out.println(i);
		}

	}

	private static String sort(String tmp) {
		// TODO Auto-generated method stub
		char[] str = tmp.toCharArray();
		Arrays.sort(str);
		return new String(str);
	}

}