阿里面试题:比如a b b a c d找出不重复的第一个字符,时间复杂度O(n)
//思路 HashMap实现
public static char firstUnichar(char[]arr) {
Map<Character,Integer> map=new HashMap<>();
map.put(arr[0],1);
for (int i = 1; i < arr.length; i++) {
if(map.containsKey(arr[i])){
int count =map.get(arr[i]);
count++;
map.put(arr[i],count);
}
else{
map.put(arr[i],1);
}
}
for (int i = 0; i < arr.length; i++) {
if(map.get(arr[i])==1)
return arr[i];
}
throw new IllegalArgumentException("No Solution.");
}
//测试类:
class FirstUniqueChar{
public static void main(String[] args) {
char[]c=new char[]{'a','b','b','a','c','d'};
char res=firstUnichar(c);
//输出 c
System.out.println(res);
}
}