作者自己建立的网站,榆林建设银行的网站,内容营销的概念,软件系统开发流程思路#xff1a; 用一个新链表来表示合并后的有序链表#xff0c; 每次比较两个链表#xff0c;将较小的那个结点存储至新链表中
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, val0, nextNone):
# self.val val
# … 思路 用一个新链表来表示合并后的有序链表 每次比较两个链表将较小的那个结点存储至新链表中
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, val0, nextNone):
# 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]if list1 is None:if list2 is None:return Noneelse:return list2else:if list2 is None:return list1preList ListNode(0)p preListwhile list1 and list2:if list1.vallist2.val:p.nextlist1list1list1.nextelse:p.nextlist2list2list2.nextp p.nextif list1 is None:p.nextlist2else:p.nextlist1return preList.next
