First Unique Character in a String

Desicription

Given a string, find the first non-repeating character in it and return it’s index. If it doesn’t exist, return -1.

Examples:

1
2
3
4
5
s = "leetcode"
return 0.

s = "loveleetcode",
return 2.

Note: You may assume the string contain only lowercase letters.

Solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
class Solution {
public:
int firstUniqChar(const std::string& s) {
auto book = std::vector<int>(26, false);
for(int i = 0; i < s.size(); i++) {
book[s[i] - 'a']++;
}

for(int i = 0; i < s.size(); i++) {
if(book[s[i] - 'a'] == 1) {
return i;
}
}

return -1;
}
};