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

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
        # 构建了一个新的current列表，而不是修改原先的l1和l2
        current = ListNode(0)
        head = current
        while pHead1 and pHead2:
            if pHead1.val <= pHead2.val:
                current.next = pHead1
                pHead1 = pHead1.next
            else:
                current.next = pHead2
                pHead2 = pHead2.next
            current = current.next
            
        if pHead1:
            current.next = pHead1 

        if pHead2:
            current.next = pHead2
        
        #不返回最开始的0
        head = head.next
        return  head