感觉相比于计数排序,这个题目还是保守了
class Solution {
public:
int firstUniqChar(string s) {
int track[26] = { 0 };
for (auto press : s)
{
track[press - 'a']++;
}
for (int i = 0; i < s.size(); ++i)
{
if (track[s[i] - 'a'] == 1)
return i;
}
return -1;
}
};