剑指 Offer 25：合并两个排序的链表

合并两个排序的链表

输入两个递增排序的链表，合并这两个链表并使新链表中的节点仍然是递增排序的。

示例1：

输入：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
        """
        frist = l1
        second = l2
        cur = pre = ListNode(0)
        while frist!= None and second != None:
            if frist.val < second.val:
                pre.next = frist
                frist = frist.next
            else:
                pre.next = second
                second = second.next
            pre = pre.next
        if second != None:
            pre.next = second
        if frist != None:
            pre.next = frist
        return cur.next