[英]Remove duplicates in python list but remember the index
如何删除列表中的重复项,保留项目的原始顺序并记住列表中任何项目的第一个索引?
例如,从[1, 1, 2, 3]
1,1,2,3]中删除重复项会产生[1, 2, 3]
但我需要记住索引[0, 2, 3]
。
我使用的是Python 2.7。
我会稍微解决这个问题并使用OrderedDict
并且列表index
方法将返回项目的最低索引。
>>> from collections import OrderedDict
>>> lst = [1, 1, 2, 3]
>>> d = OrderedDict((x, lst.index(x)) for x in lst)
>>> d
OrderedDict([(1, 0), (2, 2), (3, 3)]
如果您需要列表(删除重复项)和索引,您可以简单地发出:
>>> d.keys()
[1, 2, 3]
>>> d.values()
[0, 2, 3]
使用enumerate
跟踪索引和一组跟踪元素:
l = [1, 1, 2, 3]
inds = []
seen = set()
for i, ele in enumerate(l):
if ele not in seen:
inds.append(i)
seen.add(ele)
如果你想要两个:
inds = []
seen = set()
for i, ele in enumerate(l):
if ele not in seen:
inds.append((i,ele))
seen.add(ele)
或者如果你想要两个在不同的列表中:
l = [1, 1, 2, 3]
inds, unq = [],[]
seen = set()
for i, ele in enumerate(l):
if ele not in seen:
inds.append(i)
unq.append(ele)
seen.add(ele)
使用套装是迄今为止最好的方法:
In [13]: l = [randint(1,10000) for _ in range(10000)]
In [14]: %%timeit
inds = []
seen = set()
for i, ele in enumerate(l):
if ele not in seen:
inds.append((i,ele))
seen.add(ele)
....:
100 loops, best of 3: 3.08 ms per loop
In [15]: timeit OrderedDict((x, l.index(x)) for x in l)
1 loops, best of 3: 442 ms per loop
In [16]: l = [randint(1,10000) for _ in range(100000)]
In [17]: timeit OrderedDict((x, l.index(x)) for x in l)
1 loops, best of 3: 10.3 s per loop
In [18]: %%timeit
inds = []
seen = set()
for i, ele in enumerate(l):
if ele not in seen:
inds.append((i,ele))
seen.add(ele)
....:
10 loops, best of 3: 22.6 ms per loop
因此,对于100k
元素10.3
秒对22.6 ms
,如果你尝试使用更少的欺骗,如[randint(1,100000) for _ in range(100000)]
你将有时间阅读一本书。 创建两个列表的速度略慢,但仍比使用list.index快几个数量级。
如果要一次获取一个值,可以使用生成器函数:
def yield_un(l):
seen = set()
for i, ele in enumerate(l):
if ele not in seen:
yield (i,ele)
seen.add(ele)
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.