算法:差分数组
def cpusuanlifenpei(l1n,l2n,l1,l2):
cha=abs(l1n-l2n)
if l1n>l2n:
l2+=[0 for _ in range(cha)]
else:
l1+=[0 for _ in range(cha)]
l1=sorted(l1)
l2=sorted(l2)
chastack=[x-y for x,y in zip(l1,l2)]
ans=[]
total=chastack[0]
sumt=sum(l1)-sum(l2)
for i,j in list(enumerate(chastack)) :
if l1[i]==0 or l2[i]==0:
continue
if sumt-2*j==0:
return [l1[i],l2[i]]
7637

被折叠的 条评论
为什么被折叠?



