UVa 10815 - Andy's First Dictionary
题目描述 : 输入一个文本,找出所有的单词,按字典序输出,不区分大小写。
思路 : 正则表达式匹配单词变成小写后 存入排序集合,遍历输出即可。
Java代码 :
import java.util.*; import java.util.regex.Matcher; import java.util.regex.Pattern; public class Main10815 { public static void main(String[] args) { Scanner scan = new Scanner(System.in); SortedSet<String> st = new TreeSet<String>(); Pattern p = Pattern.compile("[a-z]+"); String str; StringBuilder strB = new StringBuilder(); while(scan.hasNextLine()) { str = scan.nextLine(); strB.append(" " +str.toLowerCase()); } String ans = strB.toString(); Matcher m = p.matcher(ans); while(m.find()) { st.add(m.group()); } for(String i : st) { System.out.println(i); } } }
作者:Pickle
声明:对于转载分享我是没有意见的,出于对博客园社区和作者的尊重一定要保留原文地址哈。
致读者:坚持写博客不容易,写高质量博客更难,我也在不断的学习和进步,希望和所有同路人一道用技术来改变生活。觉得有点用就点个赞哈。
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111112835275-168981902.gif)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111112841431-2047172832.jpg)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111112847494-1544911856.jpg)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111112904385-918783221.jpg)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111120143119-1302805212.jpg)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111112856369-1466718103.jpg)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111112830416-794416355.jpg)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111113919510-1155220901.gif)