package 集合;
//集Set,没有重复元素的元素集合,元素以随机的顺序出现
import java.util.HashSet;
import java.util.Iterator;
import java.util.Scanner;
//从system.in中读取单词,然后将它们添入一个集中,最后再打印出集中的前5个单词(不是字符)
public class SetTest {
public static void main(String[] args) {
var words = new HashSet<String>();
long totalTime = 0;
try (var in = new Scanner(System.in))
{
while (! in.hasNext("EOF")){
String word = in.next();//此处为string,不是单字符char
long callTime = System.currentTimeMillis();
words.add(word);
callTime = System.currentTimeMillis() - callTime;
totalTime += callTime;
}
}
Iterator<String> iter = words.iterator();
//System.out.println(words);
for(int i = 1; i <= 5 && iter.hasNext(); i++){
System.out.println(iter.next());
}
System.out.println(words.size() + " distinct words " + totalTime + " milliseconds");
}
}
03-24
334
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
03-26
301
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
“相关推荐”对你有帮助么?
-
非常没帮助
-
没帮助
-
一般
-
有帮助
-
非常有帮助
提交