题目链接:https://leetcode-cn.com/problems/first-unique-character-in-a-string/
题目如下:
class Solution {
public int firstUniqChar(String s) {
HashMap<Character,Integer> hashmap=new HashMap<Character,Integer>();
//题目的理解:凡是字符串中出现的所有字符,找出整个串中只出现一次的字符
//tip:但凡统计出现次数,第一想到hashmap
for(int i=0;i<s.length();i++){
int count=hashmap.getOrDefault(s.charAt(i),0)+1;
hashmap.put(s.charAt(i),count);
}
for(int i=0;i<s.length();i++){
int count=hashmap.get(s.charAt(i));
if(count==1) return i;
}
return -1;
}
}