leetcode刷题笔记18

面试题25. 合并两个排序的链表

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

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
class Solution:    
	def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
		temp = ListNode(0)
		temp2 = temp
		while l1 and l2:
			if l1.val < l2.val:
				temp.next = ListNode(l1.val)
				temp = temp.next
				l1 = l1.next
			else:
				temp.next = ListNode(l2.val)
				temp = temp.next
				l2 = l2.next
		if l1:
			temp.next = l1
		if l2:
			temp.next = l2
		return temp2.next