LeetCode 387. First Unique Character in a String

1
2
3
4
5
6
7
8
9
10
11
12
class Solution {
public:
int firstUniqChar(string s) {
unordered_map<int, int> frequency;
for (char ch: s)
++frequency[ch];
for (int i = 0; i < s.size(); ++i)
if (frequency[s[i]] == 1)
return i;
return -1;
}
};