题解 | #合并两个排序的链表#

# -*- coding:utf-8 -*-
class ListNode:
    def __init__(self, x):
        self.val = x
        self.next = None


class Solution:
    # 返回合并后列表
    def Merge(self, pHead1: ListNode, pHead2: ListNode):
    # write code here
        res=ListNode(0)
        tmp=res
        while pHead1  and pHead2:
            if pHead1.val<=pHead2.val:
                tmp.next=ListNode(pHead1.val)
                pHead1=pHead1.next
                tmp=tmp.next
            else:
                tmp.next = ListNode(pHead2.val)
                pHead2 = pHead2.next
                tmp = tmp.next
        if pHead1 is None:
            tmp.next = pHead2
        if pHead2 is None:
            tmp.next = pHead1
        return res.next


s=Solution()
pHead1=ListNode(1)
pFont1=pHead1
pFont1.next=ListNode(3)
pFont1=pFont1.next
pFont1.next=ListNode(5)
pFont1=pFont1.next
p=pHead1
while p is not None:
    print(p.val)
    p=p.next
pHead2=ListNode(2)
pFont2=pHead2
pFont2.next=ListNode(4)
pFont2=pFont2.next
pFont2.next=ListNode(6)
pFont2=pFont2.next
p=pHead2
while p is not None:
    print(p.val)
    p=p.next
print('--------')
data=s.Merge(pHead1,pHead2)
p=data
while p:
    print(p.val)
    p=p.next

data=ListNode(1)
print(data.next is None)