数据结构算法之求中位数

def findmidsort(list1,list2):
    num = []
    while list1 and list2:
        if list1[0] > list2[0]:
            num.append(list2[0])
            list2.pop(0)      #除去list2[0]元素后的list2列表
        else:
            num.append(list1[0])
            list1.pop(0)
    if list1 != 0:
        num.extend(list1) 
    if list2 != 0:
        num += list2   #等同以上extend（）函数
    if len(num)%2 ==0:
        tem = int(len(num)/2) #需要整形转换
        res = (num[tem] + num[tem-1])/2
    else:
        res = num[int(len(num)/2)]
    return res

list1 = [1,2,3,6,9,10]
list2 = [1,3,4,11,12,13,14,15,16]
print(findmidsort(list1,list2))