我读了一份求职面试问题,为下面写了一些代码:
Write an efficient function to find the first nonrepeated character in
a string. For instance, the first nonrepeated character in “total” is
‘o’ and the first nonrepeated character in “teeter” is ‘r’. Discuss
the efficiency of your algorithm.
我在Python中提出了这个解决方案;但是,我确信有更好的方法可以做到这一点.
word="googlethis"
dici={}
#build up dici with counts of characters
for a in word:
try:
if dici[a]:
dici[a]+=1
except:
dici[a]=1
# build up dict singles for characters that just count 1
singles={}
for i in dici:
if dici[i]==1:
singles[i]=word.index(i)
#get the minimum value
mini=min(singles.values())
#find out the character again iterating...
for zu,ui in singles.items():
if ui==mini:
print zu
有更简洁有效的答案吗?
解决方法:
In [1033]: def firstNonRep(word):
......: c = collections.Counter(word)
......: for char in word:
......: if c[char] == 1:
......: return char
......:
In [1034]: word="googlethis"
In [1035]: firstNonRep(word)
Out[1035]: 'l'
编辑:如果你想实现相同的事情而不使用像Counter这样的帮手:
def firstNonRep(word):
count = {}
for c in word:
if c not in count:
count[c] = 0
count[c] += 1
for c in word:
if count[c] == 1:
return c
标签:python,algorithm
来源: https://codeday.me/bug/20190927/1822864.html