合并两个排序链表
题目描述
输入两个单调递增的链表,输出两个链表合成后的链表,当然我们需要合成后的链表满足单调不减规则。时间限制:C/C++ 1秒,其他语言2秒 空间限制:C/C++ 32M,其他语言64M
解题思路
- · 把pHead2往pHead1的中插。
· 比较pHead2与pHead1的值:
· 当pHead2值小等于pHead1值时往pHead1的前面插,并让pHead2指向下一个元素
· 否则不进行插入,pHead1指向下一个结点。
· 重复上述操作,直到有一个链表为空
· 判断是哪个链表空了,如果是pHead2则说明pHead2已全部插入直接返回头结点即 可。如果pHead1,则将剩下的pHead2结点直接连到pHead1尾部,返回头结点即可。
class Solution:
def Merge(self, pHead1, pHead2):
if not pHead1:
return pHead2
if not pHead2:
return pHead1
newHead = pHead1 if pHead1.val < pHead2.val else pHead2
pTmp1 = pHead1
pTmp2 = pHead2
if newHead == pTmp1:
pTmp1 = pTmp1.next
else:
pTmp2 = pTmp2.next
prePointer = newHead
while pTmp1 and pTmp2:
if pTmp1.val < pTmp2.val:
prePointer.next = pTmp1
prePointer = pTmp1
pTmp1 = pTmp1.next
else:
prePointer.next = pTmp2
prePointer = pTmp2
pTmp2 = pTmp2.next
if pTmp1 == None:
prePointer.next = pTmp2
else:
prePointer.next = pTmp1
return newHead