LeetCode387. First Unique Character in a String

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

Examples:

s = "leetcode"
return 0.

s = "loveleetcode",
return 2.

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

class Solution {
public:
    int firstUniqChar(string s) {
        int num[26] = {0};
        int pos[26] = {0};
        for (int i = 0; i < s.size(); i++) {
            char c = s[i];
            num[c-'a']++;
            pos[c-'a'] = i;
        }
        int i = 0;
        int idx = s.size();
        while (i < 26)
        {
            if (num[i] == 1) {
                if (pos[i] < idx) idx = pos[i];
            }
            i++;
        }
        if (idx == s.size())
            idx = -1;
        return idx;
    }
};