python创建列表最快方法_在Python中创建严格增加的列表的最快方法

I would like to find out what is the most efficient way to achieve the following in Python:

Suppose we have two lists a and b which are of equal length and contain up to 1e7 elements.

However, for the ease of illustration we may consider the following:

a = [2, 1, 2, 3, 4, 5, 4, 6, 5, 7, 8, 9, 8,10,11]

b = [1, 2, 3, 4, 5, 6, 7, 8, 9,10,11,12,13,14,15]

The goal is to create a strictly monotonic list a_new from a whereas only the first sample point of sample points with identical values is used.

The same indices that have to be deleted in a should also be deleted in b such that the final result will be:

a_new = [2, 3, 4, 5, 6, 7, 8, 9,10,11]

b_new = [1, 4, 5, 6, 8,10,11,12,14,15]

Of course this can be done using computationally expensive for loops which is however not suitable due to the huge amount of data.

Any suggestions are very appreciated.

解决方案

Running a version of @juanpa.arrivillaga's function with numba

import numba

def psi(A):

a_cummax = np.maximum.accumulate(A)

a_new, idx = np.unique(a_cummax, return_index=True)

return idx

def foo(arr):

aux=np.maximum.accumulate(arr)

flag = np.concatenate(([True], aux[1:] != aux[:-1]))

return np.nonzero(flag)[0]

@numba.jit

def f(A):

m = A[0]

a_new, idx = [m], [0]

for i, a in enumerate(A[1:], 1):

if a > m:

m = a

a_new.append(a)

idx.append(i)

return idx

timing

%timeit f(a)

The slowest run took 5.37 times longer than the fastest. This could mean that an intermediate result is being cached.

1000000 loops, best of 3: 1.83 µs per loop

%timeit foo(a)

The slowest run took 9.41 times longer than the fastest. This could mean that an intermediate result is being cached.

100000 loops, best of 3: 6.35 µs per loop

%timeit psi(a)

The slowest run took 9.66 times longer than the fastest. This could mean that an intermediate result is being cached.

100000 loops, best of 3: 9.95 µs per loop