解题思路:
- 设置一个头结点或者是待插入的链表
- 遍历那给出来的两个链表,遍历的过程中比较并且把链表的结点插入到待插入的链表中
- 两条链表长短不一,所以可能会有某一条先结束,因此在两条都进行比较以后需要再判断是否有某一条链表还有结点没加进去
# 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
res = ListNode(-1)
p = pHead1
q = pHead2
r = res
while p and q:
if p.val < q.val:
r.next = p
p = p.next
else:
r.next = q
q = q.next
r = r.next
while p:
r.next = p
p = p.next
r = r.next
while q:
r.next = q
q = q.next
r = r.next
return res.next