剑指 Offer 25. 合并两个排序的链表

链接：剑指 Offer 25. 合并两个排序的链表

 依次判断两个链表的结点大小，依次遍历即可

# 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:
        # if l1 is None:
        #     return l2
        # if l2 is None:
        #     return l1
        # if l1.val > l2.val:
        #     l3 = l2
        #     l2 = l2.next
        # else:
        #     l3 = l1
        #     l1 = l1.next
        # p = l3
        # while l1 and l2:
        #     if l1.val > l2.val:
        #         p.next = l2
        #         l2 = l2.next
        #     else:
        #         p.next = l1
        #         l1 = l1.next
        #     p = p.next
        # if l1 is None:
        #     p.next = l2
        # else:
        #     p.next = l1
        # return l3

        l3 = p = ListNode(0)
        while l1 and l2:
            if l1.val > l2.val:
                p.next = l2
                l2 = l2.next
            else:
                p.next = l1
                l1 = l1.next
            p = p.next
        p.next = l1 if l1 else l2
        return l3.next