LeetCode-21合并两个有序链表

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

        chushihua = ListNode(0)
        new = chushihua

        while list1 and list2:
            if list1.val <= list2.val:
                new.next =list1
                list1 = list1.next
            else:
                new.next = list2
                list2 = list2.next
            new = new.next
        
        new.next = list1 if list1 is not None else list2
        return chushihua.next