注意一点:返回的顺序是在原来s中的顺序,后来才发现。
# -*- coding:utf-8 -*-
class Solution:
def FirstNotRepeatingChar(self, s):
# write code here
d={}
res=[]
if not s:
return -1
for i in range(len(s)):
if s[i] not in d:
d[s[i]]=1
res.append(s[i])
else:
d[s[i]]+=1
count=0
for i in range(len(res)):
if d[res[i]]==1:
return s.find(res[i])
else:
continue
return -1
别人的做法:一步
if not s:
return -1
for index,value in enumerate(s):
if s.count(value)==1:
return index