Easy-33

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

AC:

int firstUniqChar(char* s) {
    int a[26]={0};
    int b[26]={0};
    int len=strlen(s);
    for(int i=0;i<len;i++)
    {
        if(a[s[i]-'a']==0)
        {
            b[s[i]-'a']=i;
        }
        a[s[i]-'a']++;
    }
    int min=len+1;
    for(int i=0;i<26;i++)
    {
        if(a[i]==1&&b[i]<min)
        {
            min=b[i];
        }
    }
    if(min==len+1){
        return -1;
    }
    else{
        return min;
    }
}

tips:“bb” 这种情况是-1