leetcode_21. 合并两个有序链表

题目

leetcode题目链接

思路分析

题目要求：合并两个有序链表

• 2个小的链表交叉合并，小的先链接起来。

代码展示

# 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:
        p = l1
        q = l2
        #设置头节点
        dummy = ListNode(0)
        t = dummy
        # while q!=None and q!=None:
        #2个小的链表交叉合并
        while p and q:
            if q.val<=p.val:
                t.next = q
                q = q.next
            else:
                t.next = p
                p = p.next
            t = t.next
        if p:
            t.next=p
        if q:
            t.next=q
        return dummy.next