UVa-10815 Andy's First Dictionary

Question

题目链接：http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=18649
以下是我的java代码：

 package UVaOJ;

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

public class Main {

    public static String filter(String s){
        StringBuilder sb = new StringBuilder();
        for(char c:s.toCharArray()){
            if(Character.isAlphabetic(c)) sb.append(c);
            else sb.append(" ");
        }
        return sb.toString();
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        TreeSet<String> ts = new TreeSet<String>();
        while(sc.hasNext()){
            String s = filter(sc.nextLine().toLowerCase());
            String[] str = s.split(" +");   
            for(String ss:str){
                if(ss != "") ts.add(ss);
            }
        }
        for(String s:ts){
            System.out.println(s);
        }
        sc.close();

    }

}

提交WA，求解～

Answer 1

String[] str = s.split(" +");
->
String[] str = s.split("\s+");