NC33 合并有序链表

描述

将两个有序的链表合并为一个新链表，要求新的链表是通过拼接两个链表的节点来生成的，且合并后新链表依然有序。

示例1

输入：

{1},{2}

返回值：

{1,2}

示例2

输入：

{2},{1}

返回值：

{1,2}

# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

#
# 
# @param l1 ListNode类 
# @param l2 ListNode类 
# @return ListNode类
#
class Solution:
    def mergeTwoLists(self , l1 , l2 ):
        tmp = ListNode(0)
        result = tmp
        while l1 != None and l2 != None:
            if l1.val < l2.val:
                tmp.next, l1 = l1, l1.next
                tmp = tmp.next
            else:
                tmp.next, l2 = l2, l2.next
                tmp = tmp.next
        if l1 != None:
            tmp.next = l1
        elif l2 != None:
            tmp.next = l2
        result = result.next
        return result
        # write code here