JZ25合并两个排序的链表

JZ25合并两个排序的链表

解法思路：遍历两个链表并比较大小，创建一个新的链表pHead3,pHead.next指向小的val，每次遍历需要更新pHead3的Head，如果pHead1和pHead2有剩余，就将l3的next全部指向剩余,最后返回head

# 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
        pHead3 = ListNode(0)
        l3 = pHead3 # 由于每次遍历需要更新pHead3的Head，所以要用l3暂存链表
        while pHead1  and pHead2:
            if pHead1.val < pHead2.val:
                l3.next = pHead1
                pHead1 = pHead1.next    
            else:
                l3.next = pHead2
                pHead2 = pHead2.next
            l3 = l3.next
        if pHead1:
            l3.next = pHead1
        if pHead2:
            l3.next = pHead2
        return pHead3.next

t = pHead2
return pHead3.next