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

from sys import path_importer_cache
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param pHead1 ListNode类 
# @param pHead2 ListNode类 
# @return ListNode类
#
class Solution:
    def Merge(self , pHead1: ListNode, pHead2: ListNode) -> ListNode:
        pHead3 = ListNode(0)
        p = pHead3
        if pHead1 == None:
            p.next = pHead2
        elif pHead2 == None:
            p.next = pHead1
        while pHead1 and pHead2:
            a = pHead1.val
            b = pHead2.val
            if a < b:
                p.next = pHead1
                p = p.next
                pHead1 = pHead1.next
            else:
                p.next = pHead2
                p = p.next
                pHead2 = pHead2.next
            p.next = pHead1 if pHead1 else pHead2
        return pHead3.next

        # write code here