题解:
class Solution:
def maximumPrimeDifference(self, nums: list[int]) -> int:
primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]
prime_idx = []
for i, num in enumerate(nums):
# print(i, num)
if num in primes:
prime_idx.append(i)
print(prime_idx)
return (max(prime_idx) - min(prime_idx))
s = Solution()
print(s.maximumPrimeDifference([7,78,49,83,8])) # 3
enumerate()函数:
l = [2 ,4, 5, 2, 5]
for i , num in enumerate(l):
print (i, num)
默认从0开始迭代,如果有写,
l = [2 ,4, 5, 2, 5]
for i , num in enumerate(l, 2):
print (i, num)