題目：給定兩個有序單鏈表的頭節點head1和head2，請合并兩個有序鏈表，合并后的鏈表依然有序，并返回合并后鏈表的頭節點

class node:def __init__(self,value):self.value = valueself.next = Nonedef merge(head1,head2):if head1 == None or head2 == None:if head2 == None:return head1 else:return head2head = head1 if head1.value < head2.value else head2if head == head1:cur1 = head1cur2 = head2else:cur1 = head2cur2 = head1pre = Nonewhile cur1!=None and cur2!=None:if cur1.value <= cur2.value:pre = cur1cur1 = cur1.nextelse:next_ = cur2.nextpre.next = cur2cur2.next = cur1pre = cur2cur2 = next_if cur2 == None:pre.next = cur1else:pre.next = cur2return head

?

總結

以上是生活随笔為你收集整理的合并两个有序的单链表的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。