代码核心思路:比较两链表的值,将小值赋给结果链表,并后移小值所在链表的指针。
class Solution:
def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
res=ListNode(None)
node=res
while l1 and l2:
if l1.val<l2.val:
node.next,l1 = l1,l1.next
else:
node.next,l2 = l2,l2.next
node=node.next
if l1 is not None:
node.next=l1
else:
node.next=l2
return res.next