class Solution:
def firstUniqChar(self, s: str) -> int:
if len(s) == 0:
return -1
visited = {} #保存奇数重复的字母
visited_list = {} #保存所有重复的字母
for i, char in enumerate(s):
try:
visited.pop(char)
visited_list[char] = 1
except:
visited[char] = i
for key in visited.keys():
if key not in visited_list:
return visited[key]
return -1
两个dict的方法,不知道为啥居然比别人的慢,O(2n)