创建一个链表生成类

  1. class ListNode:
  2.     def __init__(self, x):
  3.         self.val = x
  4.         self.next = None
  6. class LinkList:
  7.     def __init__(self):
  8.         self.head = None
  10.     def initList(self, data):
  11.         # 创建头结点
  12.         self.head = ListNode(data[0])
  13.         r = self.head
  14.         p = self.head
  15.         # 逐个为 data 内的数据创建结点, 建立链表
  16.         for i in data[1:]:
  17.             node = ListNode(i)
  18.             p.next = node
  19.             p = p.next
  20.         return r
  22.     def printlist(self, head):
  23.         if head == None: return
  24.         node = head
  25.         while node != None:
  26.             print(node.val, end=' ')
  27.             node = node.next

链表合并函数

  1. def mergeTwoLists(A, B):
  2.     if A is None:
  3.         return B
  4.     elif B is None:
  5.         return A
  6.     listMerge = None
  7.     if A.val < B.val:
  8.         listMerge = A
  9.         listMerge.next = mergeTwoLists(A.next, B)
  10.     else:
  11.         listMerge = B
  12.         listMerge.next = mergeTwoLists(B.next, A)
  13.     return listMerge

测试：

l=LinkList()
data1 = [1, 2, 3]
data2= [2, 4, 6]
l1=l.initList(data1)
l2=l.initList(data2)
ret = mergeTwoLists(l1, l2)
print(ret)