题目
将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4 输出:1->1->2->3->4->4
python代码实现:
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def mergeTwoLists(self, l1, l2):
"""
:type l1: ListNode
:type l2: ListNode
:rtype: ListNode
"""
l=ListNode(0)
f = l
while l1 and l2 :
if l1.val < l2.val:
l.next = l1
l1=l1.next
else:
l.next = l2
l2 = l2.next
l = l.next
if l1 is not None:
l.next=l1
elif l2 is not None:
l.next = l2
return f.next