力扣刷题 21、合并两个有序链表

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def mergeTwoLists(self, list1: Optional[ListNode], list2: Optional[ListNode]) -> Optional[ListNode]:
        head = ListNode(0)
        p = head

        if list1 == None:
            return list2
        if list2 == None:
            return list1
        while list1 and list2:
            if list1.val >= list2.val:
                p.next = ListNode(list2.val)
                list2 = list2.next
                p = p.next
            else:
                p.next = ListNode(list1.val)
                list1 = list1.next
                p = p.next
        while list1:
            p.next = ListNode(list1.val)
            list1 = list1.next
            p = p.next
        
        while list2:
            p.next = ListNode(list2.val)
            list2 = list2.next
            p = p.next
        return head.next