题目:
给定一个字符串,找到它的第一个不重复的字符,并返回它的索引。如果不存在,则返回 -1。
案例:
s = "leetcode" 返回 0. s = "loveleetcode", 返回 2.
代码:
class Solution:
def firstUniqChar(self, s: str) -> int:
dic = {}
for i in s:
if i in dic:
dic[i] += 1
else:
dic[i] = 1
for i in dic:
if dic[i] == 1:
return s.index(i)
return -1