leetcode——21. 合并两个有序链表

 

# 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 == None and l2 == None:
            return None
        elif l1 == None:
            return l2
        elif l2 == None:
            return l1
        else:
            res=ListNode(None)
            tmp=res

            while l1!=None and l2!=None:
                if l1.val<l2.val:
                    tmp.next=l1
                    l1=l1.next
                else:
                    tmp.next=l2
                    l2=l2.next

                tmp=tmp.next

            if l1!=None:
                tmp.next=l1
            else:
                tmp.next=l2

        return res.next