class Solution {
public char firstUniqChar(String s) {
char[] chars = s.toCharArray();
Map<Character, Boolean> map = new HashMap<>();
for (int i=0; i<chars.length; i++) {
map.put(chars[i],map.containsKey(chars[i]));
}
for (int i=0; i<chars.length; i++) {
if(!map.get(chars[i])) {
return chars[i];
}
}
return ’ ';
}
}
剑指offer50第一个只出现一次的字符
最新推荐文章于 2022-04-24 13:54:57 发布