哈希

class Solution {
public:
    char firstUniqChar(string s) {
        map<char, int> hashmap;
        for(int i = 0; i < s.size(); i++)
            hashmap[s[i]] += 1;
        char ch = ‘ ‘;
        for(int i = 0; i < s.size(); i++)
            if(hashmap[s[i]] == 1)
            {
                ch = s[i];
                break;
            }
        return  ch;
    }
};

【剑指offer】【哈希】50.第一次只出现一次的字符

原文：https://www.cnblogs.com/Trevo/p/12731842.html