我已经在64位的4Gubuntu里跑Python了,可是还是memoryerror,出错的函数是这个:deftrace(node_sequence=[]):whileTrue:l=[]i=j=0whilei
我已经在64位的4Gubuntu里跑Python了,可是还是memory error,出错的函数是这个:
def trace(node_sequence=[]):
while True:
l = []
i = j = 0
while i < len(node_sequence):
flag = 0
j = 1
while j < len(node_sequence):
if node_sequence[i][len(node_sequence[i])-1] == node_sequence[j][0]:
l = l + [node_sequence[i] + node_sequence[j][1:]]
del node_sequence[j]
flag = 1
else:
j += 1
if i == len(node_sequence):
break
if flag == 0:
l += [node_sequence[i]]
i += 1
if node_sequence == l:
break
node_sequence = l
l = []
for i in node_sequence:
t = []
for j in i:
t += [int(j)]
l += [t]
return l
我要做的事情举例如下:
假设有列表list=[[0, 16], [0, 34], [10, 15], [10, 28], [20, 35], [20, 58], [34, 13], [34, 18], [34, 20]]
用完这个函数之后得到[[0, 16], [0, 34,13], [0, 34,18],[0, 34,20,35],[0, 34,20,58],[10, 15], [10, 28]]
就是相当于如果list[i][1]=list[i][0]的话,就合并这两个元素,并且删掉重复项。
当我list长度达到2000时,语句“ l = l + [node_sequence[i] + node_sequence[j][1:]]”就报错memory error
展开