LC 0021 [E] Merge Two Sorted Lists - ALawliet/algorithms GitHub Wiki
class Solution:
def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
dum = ListNode(-1)
cur = dum
while l1 and l2:
if l1.val < l2.val:
cur.next = l1
l1 = l1.next
else:
cur.next = l2
l2 = l2.next
cur = cur.next
cur.next = l1 or l2
return dum.next