python的随机位置_在python中随机查找列表中可用位置的有效算法

None

from random import random

def randint(max_val):

return int(random() * max_val)

def assign(values, target):

output = []

mapping = dict()

mmax = 0

size = len(target)

for val in values:

idx = randint(size)

while target[idx] != None:

if idx in mapping:

idx = mapping.pop(idx)

mmax = max(mapping or [0])

break

min_size = max(idx, mmax)

try:

size -= target[size-1:min_size:-1].index(None)

except:

size = min_size + 1

if target[size-1] == None:

size -= 1

mapping[idx] = size

if idx > mmax:

mmax = idx

elif size-1 in mapping:

size -= 1

mapping[idx] = mapping.pop(size)

mmax = max(mapping or [0])

idx = randint(size)

target[idx] = val

output.append(idx)

return output

请注意,这将修改传递给它的目标列表。如果您不想修改它,您实际上有两个选项:实现一些额外的逻辑来检查“空闲”地址是否已经被使用,或者复制整个列表(在这种情况下,反转它并修补索引,以便

.index()