【LEETCODE】21-Merge Two Sorted Lists

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.

题意：

将两个排好序的list合并成一个

参考：

http://www.cnblogs.com/codingmylife/archive/2012/09/27/2705286.html

http://www.cnblogs.com/zuoyuan/p/3785479.html

http://m.blog.csdn.net/blog/vvaaiinn/45499221

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