python中怎么用find索引出想要的数字_Python在列表中查找项目索引的最快方法

If one was to attempt to find the indexes of an item in a list you could do it a couple different ways here is what I know to be the fastest

aList = [123, 'xyz', 'zara','xyz', 'abc'];

indices = [i for i, x in enumerate(aList) if x == "xyz"]

print(indices)

Another way not pythonic and slower

count = 0

indices = []

aList = [123, 'xyz', 'zara','xyz', 'abc'];

for i in range(0,len(aList):

if 'xyz' == aList[i]:

indices.append(i)

print(indices)

the first method is undoubtedly faster however what if you wanted to go faster is there a way? for the first index using method

aList = [123, 'xyz', 'zara','xyz', 'abc'];

print "Index for xyz : ", aList.index( 'xyz' )

is very fast but cant handle multiple indexes How might one go about speeding things up?

解决方案def find(target, myList):

for i in range(len(myList)):

if myList[i] == target:

yield i

def find_with_list(myList, target):

inds = []

for i in range(len(myList)):

if myList[i] == target:

inds += i,

return inds

In [8]: x = range(50)*200

In [9]: %timeit [i for i,j in enumerate(x) if j == 3]

1000 loops, best of 3: 598 us per loop

In [10]: %timeit list(find(3,x))

1000 loops, best of 3: 607 us per loop

In [11]: %timeit find(3,x)

1000000 loops, best of 3: 375 ns per loop

In [55]: %timeit find_with_list(x,3)

1000 loops, best of 3: 618 us per loop

Assuming you want a list as your output:

All options seemed exhibit similar time performance for my test with the list comprehension being the fastest (barely).

And if you're cool with returning a generator, it's way faster than the other approaches. Thought it doesn't account for actually iterating over the indices, nor does it store them, so the inds cannot be iterated over a second time.