LeetCode 21. 合并两个有序链表

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

示例：

输入：1->2->4, 1->3->4
输出：1->1->2->3->4->4

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

class Solution(object):
    def mergeTwoLists(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        arr = []
        if l1 == None and l2 == None:
            return None
        if l1 == None and l2 != None:
            return l2 
        if l2 == None and l1 != None:
            return l1

        while True:
            if l1 == None:
                while l2 != None:
                    arr.append(ListNode(l2.val))
                    l2 = l2.next
                break

            if l2 == None:
                while l1 != None:
                    arr.append(ListNode(l1.val))
                    l1 = l1.next
                break

            if l1.val < l2.val:
                arr.append(ListNode(l1.val))
                l1 = l1.next
            else:
                arr.append(ListNode(l2.val))
                l2 = l2.next

        l = len(arr) - 1
        for i in range(l):
            arr[i].next = arr[i+1]

        return arr[0]