两个升序列表的合并
def merge_list(l1,l2,n1,n2):
i = 0
j = 0
m_list = []
while(1):
if(l1[i]<=l2[j]):
m_list.append(l1[i])
i = i + 1
else:
m_list.append(l2[j])
j = j + 1
if(i == n1):
m_list.extend(l2[j:n2])
break
else:
if(j == n2):
m_list.extend(l1[i:n1])
break
print(m_list)
return m_list[(n1+n2)//2]
测试:
merge_list([1,2],[3,4],2,2)
结果:
[1, 2, 3, 4]
3