可能又和标准的实现不一样,
但是自己的实现,
印象就会不一样的。
# coding = utf-8 # 两个有序列表的合并,将two_list合并到one_list def merge_order_list(one_list, two_list): for item in two_list: # 先区分元素是否比列表的最大元素还要大。 if item < one_list[-1]: for i in range(len(one_list)): # 先比较,再插入 if item <= one_list[i]: one_list.insert(i, item) break else: one_list.append(item) return one_list if __name__ == '__main__': list1 = [2, 4, 6, 89, 342, 658] list2 = [1, 4, 6, 34, 89, 321, 546, 4332] list3 = [77, 567, 3487] list4 = [8, 45, 89, 243, 765, 962] merge_list = merge_order_list(list1, list2) print(merge_list)
C:\Users\Sahara\.virtualenvs\test\Scripts\python.exe C:/Users/Sahara/PycharmProjects/test/python_search.py [1, 2, 4, 4, 6, 6, 34, 89, 89, 321, 342, 546, 658, 4332] Process finished with exit code 0