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

python 建立一个新的ListNode的写法

# 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
        all_list = []
        while pHead1!=None:
            all_list.append(pHead1.val)
            pHead1 = pHead1.next
        while pHead2!=None:
            all_list.append(pHead2.val)
            pHead2 = pHead2.next
        if all_list==[]:
            return pHead1
        else:   
            all_list.sort()
            new = ListNode(all_list[0])
            mid = new
            for item in all_list[1:]:
                prom = ListNode(item)
                mid.next = prom
                mid = mid.next
            return new