如果我有这个清单
a = [1,0,0,1,0,0,0,1]
我希望它变成
a = [1,0,0,2,0,0,0,3]
最佳答案
设置解决方案＃1和＃2
from itertools import count
to_add = count()
a = [1,0,0,1,0,0,0,1]
解决方案1
>>> [x + next(to_add) if x else x for x in a]
[1, 0, 0, 2, 0, 0, 0, 3]
解决方案＃2，hacky但有趣
>>> [x and x + next(to_add) for x in a]
[1, 0, 0, 2, 0, 0, 0, 3]
设置解决方案3和＃4
import numpy as np
a = np.array([1,0,0,1,0,0,0,1])
解决方案＃3
>>> np.where(a == 0, 0, a.cumsum())
array([1, 0, 0, 2, 0, 0, 0, 3])
解决方案4（我最喜欢的一种）
>>> a*a.cumsum()
array([1, 0, 0, 2, 0, 0, 0, 3])
所有
cumsum解决方案均假定a的非零元素均为1。时间：
# setup
>>> a = [1, 0, 0, 1, 0, 0, 0, 1]*1000
>>> arr = np.array(a)
>>> to_add1, to_add2 = count(), count()
# IPython timings @ i5-6200U CPU @ 2.30GHz (though only relative times are of interest)
>>> %timeit [x + next(to_add1) if x else x for x in a] # solution 1
669 µs ± 3.59 µs per loop (mean ± std. dev. of 7 runs, 1000 loops each)
>>> %timeit [x and x + next(to_add2) for x in a] # solution 2
673 µs ± 15.1 µs per loop (mean ± std. dev. of 7 runs, 1000 loops each)
>>> %timeit np.where(arr == 0, 0, arr.cumsum()) # solution 3
34.7 µs ± 94.2 ns per loop (mean ± std. dev. of 7 runs, 10000 loops each)
>>> %timeit arr = np.array(a); np.where(arr == 0, 0, arr.cumsum()) # solution 3 with array creation
474 µs ± 14.9 µs per loop (mean ± std. dev. of 7 runs, 1000 loops each)
>>> %timeit arr*arr.cumsum() # solution 4
23.6 µs ± 131 ns per loop (mean ± std. dev. of 7 runs, 10000 loops each)
>>> %timeit arr = np.array(a); arr*arr.cumsum() # solution 4 with array creation
465 µs ± 6.82 µs per loop (mean ± std. dev. of 7 runs, 1000 loops each)
关于python - 递增增加列表中的非零元素，我们在Stack Overflow上找到一个类似的问题：https://stackoverflow.com/questions/54031587/