题目描述
将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例 1:
输入:l1 = [1,2,4], l2 = [1,3,4] 输出:[1,1,2,3,4,4]
示例 2:
输入:l1 = [], l2 = [] 输出:[]
示例 3:
输入:l1 = [], l2 = [0] 输出:[0]
思路
1)创建两个头节点
2)遍历,两边链表,如果都有值,取值较小的接在头节点的后面
3)哪边的链表还有值,直接接在头节点的后面
4)返回头节点.next
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution(object):
def mergeTwoLists(self, list1, list2):
"""
:type list1: Optional[ListNode]
:type list2: Optional[ListNode]
:rtype: Optional[ListNode]
"""
prehead = ListNode(-1)
hair = prehead
while list1 and list2:
if list1.val < list2.val:
prehead.next = list1
list1 = list1.next
else:
prehead.next = list2
list2 = list2.next
prehead = prehead.next
if list1:
prehead.next = list1
if list2:
prehead.next = list2
return hair.next