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

# LeetCode 字符串中的第一个唯一字符
# HashMap 用字典去模拟
class Solution(object):
    def firstUniqChar(self, s: str) -> int:
        dic = {}

        # 记录字符出现次数
        for c in s:
            if c in dic:
                dic[c] = dic[c] + 1
            else:
                dic[c] = 1
        
        for k, v in dic.items():
            if v == 1:
                return s.index(k)
        return -1