解题思路:
注意事项:
参考代码:
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
String wordString = scanner.nextLine();
boolean flag = true;
Map<Character,Integer> pairs = new HashMap<>();
for (int i = 0; i < wordString.length(); i++) {
pairs.put(wordString.charAt(i), 0);
}
for (int i = 0; i < wordString.length(); i++) {
int num = pairs.get(wordString.charAt(i)) + 1;
pairs.put(wordString.charAt(i), num);
}
for (Map.Entry<Character, Integer> entry:pairs.entrySet()) {
if(entry.getValue() == 1) {
System.out.println(entry.getKey());
flag = false;
break;
}
}
if(flag) System.out.println("no");
}
}
0.0分
0 人评分
Biggest Number (C++代码)回溯法浏览:1614 |
2003年秋浙江省计算机等级考试二级C 编程题(2) (C语言代码)浏览:541 |
字符串对比 (C语言代码)浏览:1413 |
计算质因子 (C++代码)浏览:1644 |
WU-整数平均值 (C++代码)浏览:1244 |
C语言程序设计教程(第三版)课后习题6.1 (C语言代码)浏览:702 |
C语言程序设计教程(第三版)课后习题6.9 (C语言代码)浏览:641 |
C语言程序设计教程(第三版)课后习题10.4 (C语言代码)浏览:886 |
Tom数 (C语言代码)浏览:527 |
简单的a+b (C语言代码)浏览:461 |