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.

---

解题思路：找到给定字符串中，第一个非重复字符的索引。数组存储二十六字母出现的次数，遍历字符串，存储每个字符出现的次数。遍历字符串，比较每个字符对应数组中的次数

class Solution {
public:
    int firstUniqChar(string s) {
        int a[26]={0};
        for(auto x:s){
            a[x-'a']++;
        }
        for(int i=0;i<s.size();i++){
            if(a[s[i]-'a']==1){
                return i;
            }
        }
        return -1;
    }
};