leetcode--21. Merge Two Sorted Lists

题目：21. Merge Two Sorted Lists

链接：https://leetcode.com/problems/merge-two-sorted-lists/description/

在原链表的基础上合并两个有序链表。

python：

# 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
        """
        pl1,pl2=l1,l2
        res=rear=ListNode(0)
        while l1 and l2:
            if l1.val<l2.val:
                rear.next=l1
                l1=l1.next
            else:
                rear.next=l2
                l2=l2.next
            rear=rear.next
        if l1:
            rear.next=l1
        if l2:
            rear.next=l2
        return res.next