UVA 10815

题目描述:点击打开链接

/*思路:将文本进行切割后添加到树形集合中*/import java.util.Scanner;import java.util.TreeSet;public class Main{public static void main(String[] args) {//1.创建空串和树形集合Scanner cin = new Scanner(System.in);TreeSet<String> set = new TreeSet<>();String str = "";//2.输入单词,若单词有多余的标点符号将其转换为空格后//将该单词链接到空串上并添加空格便于切割while(cin.hasNext()){StringBuilder sb = new StringBuilder(cin.next());for(int i=0;i<sb.length();++i)if(!Character.isLetter(sb.charAt(i)))sb.setCharAt(i,' ');str += sb.toString()+" ";}//3.利用正则将文本切割为单词并添加进TreeSet集合中,//利用TreeSet会自动排序的特点后将其输出String arr[] = str.split(" +");for(int i=0;i<arr.length;++i)set.add(arr[i].toLowerCase());for(String s:set)System.out.println(s);}}