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

# 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:
        # write code here
        # 创建一个新链表
        new_list = ListNode(-1)
        add_list = new_list
        # 两个链表已经是递增的了，直接比较链表中的值，插入新链表
        while pHead1 and pHead2:
            if pHead1.val < pHead2.val:
                add_list.next = pHead1
                pHead1 = pHead1.next
            else:
                add_list.next = pHead2
                pHead2 = pHead2.next
            add_list = add_list.next
        # 完成链表合并后 如果有超长的链表需要额外进行合并
        if pHead1:
            add_list.next = pHead1
        if pHead2:
            add_list.next = pHead2
        return new_list.next