LeetCode：21. 合并两个有序链表（递归，Python实现）

题目：
将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。

输入：l1 = [1,2,4], l2 = [1,3,4]
输出：[1,1,2,3,4,4]

利用了递归的思想：
首先将两个链表传入，之后开始按照元素顺序进行对比，返回较小值后继续进行递归直到其中的某一个链表为空时结束。

# 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, l1: ListNode, l2: ListNode) -> ListNode:
        if l1 is None:
            return l2
        elif l2 is None:
            return l1
        elif l1.val < l2.val:
            l1.next = self.mergeTwoLists(self, l1.next, l2)
            return l1
        else:
            l2.next = self.mergeTwoLists(self, l1, l2.next)
            return l2


class Head:
    def __init__(self, next = None):
        self.next = next
a = Head()
a1 = a
for item in [ListNode(1),ListNode(2),ListNode(5)]:
    a.next = item
    a = a.next
b = Head()
b1 = b
for item in [ListNode(1),ListNode(3),ListNode(4)]:
    b.next = item
    b = b.next

Res = Solution.mergeTwoLists(Solution, a1.next, b1.next)

while Res:
    print(Res.val)
    Res = Res.next