字符串中的第一个唯一字符

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.

题意：返回一个string中第一个只出现了一次的字符

思路：遍历字符串，用哈希表统计每个字符出现的次数，再遍历一次，出现次数为1的就是要求的字符，遍历完没有找到，则返回-1

 

class Solution {
public:
    int firstUniqChar(string s) {
        unordered_map<char,int> m;
        for(int i=0;i<s.size();i++){
            m[s[i]]++;              
        }
        for(int i=0;i<s.size();i++){
            if(m[s[i]]==1) return i;
        }
        return -1;
    }
};

 

转载于:https://www.cnblogs.com/Bipolard/p/9994505.html