正常遍历比较法
class Solution:
# 返回合并后列表
def Merge(self, pHead1, pHead2):
# write code here
node = ListNode(0)
x = node
while pHead1 and pHead2:
if pHead1.val > pHead2.val:
x.next = pHead2
pHead2 = pHead2.next
else:
x.next = pHead1
pHead1 = pHead1.next
x = x.next
x.next = pHead1 or pHead2
return node.next
递归
class Solution:
# 返回合并后列表
def Merge(self, pHead1, pHead2):
# write code here
if not pHead1: return pHead2
if not pHead2: return pHead1
if pHead1.val < pHead2.val:
pHead1.next = self.Merge(pHead1.next, pHead2)
return pHead1
else:
pHead2.next = self.Merge(pHead1, pHead2.next)
return pHead2