![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/c99b8b9f02cbc54586a9e5218c51f020.png)
package qi_mo;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class Test7 {
public static void main(String[] args) {
String token = "";
Scanner scanner = new Scanner(System.in);
System.out.println("请输入一个字符串:");
String string = scanner.nextLine();
String ss = string.toLowerCase();
String[] words = ss.split("\\s+");
for (int i = 0; i < words.length; i++) {
token += words[i] + " ";
}
String[] str = token.split("[ ,.]");
Set<String> hs = new HashSet<>();
Set<String> se = new HashSet<>();
for (String s : str) {
if (!hs.add(s)) {
se.add(s);
}
}
System.out.println("不同的单词为:" + hs);
System.out.print("重复的单词为:" + se);
}
}
- 测试结果:
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/1c291e5a7355003799c67c5237ee244a.png)