publicintfirstUniqChar(String s){int[] count =newint[26];for(int i =0; i < s.length(); i++){
count[s.charAt(i)-'a']++;}for(int i =0; i < s.length(); i++){if(count[s.charAt(i)-'a']==1){return i;}}return-1;}
借用计数排序的思想,构建计数数组,并将字符-'a’作为索引,最终重新遍历字符串看是不是1返回即可 public int firstUniqChar(String s) { int[] count = new int[26]; for (int i = 0; i < s.length(); i++) { count[s.charAt(i) - 'a']++; } for (int i = 0; i &l..