This algorithm is for reference only. Xiao Cai basically doesn’t understand advanced algorithms and can only express it with the simplest thoughts.
//Find the first non-repeating character in the string
// firstUniqueChar("vdctdvc"); --> t
function firstUniqueChar(str){
var str = str || "",
i = 0,
k = "",
_char = "",
charMap = {},
result = {name: "",index: str.length};
for(i=0;i
_char = str.charAt(i);
If(charMap[_char] != undefined){
charMap[_char] = -1;
}else{
charMap[_char] = i;
}
}
for(k in charMap){
If(charMap[k]<0){
Continue;
}
If(result.index>charMap[k]){
result.index = charMap[k];
result.name = k;
}
}
Return result.name;
}
If you guys have any better ideas, please let me know, I’d be very grateful