题目描述:
输入两个递增排序的链表,合并这两个链表并使新链表中的节点仍然是递增排序的。
示例1:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
解题思路:
class Solution:
def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
ppre=pre=ListNode(-1)#新的头节点
while l1 and l2:
if l1.val<=l2.val:
pre.next=l1
pre=pre.next
l1=l1.next
#print(l1.val)
else:
pre.next=l2
pre=pre.next
l2=l2.next
if l1:
pre.next=l1
if l2:
pre.next=l2
return ppre.next
递归
if (l1 == null) {
return l2;
}
if (l2 == null) {
return l1;
}
if (l1.val <= l2.val) {
l1.next = mergeTwoLists(l1.next, l2);
return l1;
} else {
l2.next = mergeTwoLists(l1, l2.next);
return l2;
}