第一个只出现一次的字符
用LinkedHashMap统计字符出现的次数
class Solution {
public char firstUniqChar(String s) {
LinkedHashMap<Character, Integer> map = new LinkedHashMap<>();
for (int i = 0; i < s.length(); i++) {
char c = s.charAt(i);
if (map.containsKey(c)) {
map.put(c, map.get(c) + 1);
}
else {
map.put(c, 1);
}
}
for (Character character : map.keySet()) {
if (map.get(character) == 1) return character;
}
return ' ';
}
}