21. 合并两个有序链表
题目描述:
将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
解题思路:
穿针引线法,设置一个空表头,不断将L1,L2中较小的数挂在表头后边
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
head = ListNode(None)
p = head
while (l1 and l2):
# l1小,接l1
if l1.val <= l2.val:
p.next = l1
l1 = l1.next
# l2小,接l2
else:
p.next = l2
l2 = l2.next
p = p.next
# l1还未结束
if (l1 and not l2):
p.next = l1
# l2还未结束
if (not l1 and l2):
p.next = l2
return head.next