題目描述

輸入兩個(gè)單調(diào)遞增的鏈表，輸出兩個(gè)鏈表合成后的鏈表，當(dāng)然我們需要合成后的鏈表滿足單調(diào)不減規(guī)則。

解析

構(gòu)建列表

# -*- coding:utf-8 -*- # class ListNode: # def __init__(self, x): # self.val = x # self.next = None class Solution:# 返回合并后列表def Merge(self, pHead1, pHead2):# write code hereif not pHead1 and not pHead2:return res = []while pHead1 and pHead2:if pHead1.val <= pHead2.val:res.append(pHead1)pHead1 = pHead1.nextelse:res.append(pHead2)pHead2 = pHead2.nextwhile pHead1:res.append(pHead1)pHead1 = pHead1.nextwhile pHead2:res.append(pHead2)pHead2 = pHead2.nextn = len(res)for i in range(n):if i == n - 1:res[i].next = Noneelse:res[i].next = res[i+1]return res[0]

2. 構(gòu)建兩個(gè)頭結(jié)點(diǎn)

# -*- coding:utf-8 -*- class ListNode:def __init__(self, x):self.val = xself.next = None class Solution:# 返回合并后列表def Merge(self, pHead1, pHead2):# write code hereres = head = ListNode(0)while pHead1 and pHead2:if pHead1.val < pHead2.val:head.next = pHead1pHead1 = pHead1.nextelse:head.next = pHead2pHead2 = pHead2.nexthead = head.nextif pHead1:head.next = pHead1if pHead2:head.next = pHead2return res.next

總結(jié)

以上是生活随笔為你收集整理的python实现合并链表_python：16.合并两个排序的链表的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。