leetcode---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.

class Solution {
public:
    int firstUniqChar(string s) 
    {
        int cnt[26];
        memset(cnt, 0, sizeof(cnt));
        for(int i=0; i<s.length(); i++)
            cnt[s[i] - 'a']++;
        for(int i=0; i<s.length(); i++)
            if(cnt[s[i] - 'a'] == 1)
                return i;
        return -1;
    }
};