擅长:python、mysql、java
<p>在代码中,需要检查索引是否为素数,如果不是,则添加值,否则继续</p>
<pre><code>def primes(n): # simple Sieve of Eratosthenes
odds = range(3, n+1, 2)
sieve = set(sum([list(range(q*q, n+1, q+q)) for q in odds],[]))
return [2] + [p for p in odds if p not in sieve]
l = [-1,-2,-3,3,4,-7]
length = len(l)
prime = primes(length)
sol = 0
for i, v in enumerate(l):
if i not in prime:
sol += v
print(sol) # output 1
</code></pre>