将2个有序list 组合成一个有序list，并用最小算法复杂度

#思路，分别比较2个list，
def  2listsort(ls1,ls2):
    ls = []    #存放新的有序数列
    while len(ls1) > 0 and len(ls2)>0:
        if ls1[0] < ls2[0]:
            ls.append(ls1[0])
            ls1.pop(0)
        else:
            ls.append(ls2[0])
            ls2.pop(0)
    if len(ls1) == 0:
        ls = ls + ls2
    else:
        ls = ls + ls1
    return ls

if __name__=='__main__':
    ls1 = [1,4,6,13,24,26]
    ls2 = [2,3,4,21,27]
    ls = 2listsort(ls1,ls2)