如題~
此算法僅供參考,小菜基本不懂高深的算法,隻能用最樸實的思想去表達。
![](https://img.laitimes.com/img/9ZDMuAjOiMmIsIjOiQnIsIiZpdmLrN2bsJEZlR3YhJHdu92Qvw1cy9GdhNWak5WSn5WaulGb0V3TvwVbvNmLzd2bsJmbj5ycldWYtl2Lc9CX6MHc0RHaiojIsJye.gif)
1 //找出字元串中第一個不重複的字元
2 // firstUniqueChar("vdctdvc"); --> t
3 function firstUniqueChar(str){
4 var str = str || "",
5 i = 0,
6 k = "",
7 _char = "",
8 charMap = {},
9 result = {name: "",index: str.length};
10
11 for(i=0;i<str.length;i++){
12 _char = str.charAt(i);
13 if(charMap[_char] != undefined){
14 charMap[_char] = -1;
15 }else{
16 charMap[_char] = i;
17 }
18 }
19
20 for(k in charMap){
21 if(charMap[k]<0){
22 continue;
23 }
24 if(result.index>charMap[k]){
25 result.index = charMap[k];
26 result.name = k;
27 }
28 }
29
30 return result.name;
31 }
View Code