21. Merge Two Sorted Lists (python 3)

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

Example:

Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4

code

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def mergeTwoLists(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        head = ListNode(0)
        node = head
        if l1 == None:
            return l2
        elif l2 == None:
            return l1
        
        while(l1 != None or l2 != None):
            if l1 == None:
                node.next = l2
                l2 = l2.next
            elif l2 == None:
                node.next = l1
                l1 = l1.next
            else:
                if l1.val > l2.val:
                    node.next = l2
                    l2 = l2.next
                else:
                    node.next = l1
                    l1 = l1.next
            node = node.next
        
        return head.next
        ```