题目:输入两个单调递增的链表,输出两个链表合成后的链表,当然我们需要合成后的链表满足单调不减规则。
数据范围:0≤n≤1000
看到题的一瞬间,简单嘛,把两个链表内的元素拿出来放进一个数组里,排完序以后,再把数组初始化为链表(不愧是头脑简单,四肢发达的我),我这么干了,代码也过了。然后翻看题解区,嗯~~~~,不愧是头脑简单的我,和题解区不沾一点边……
下面是题解区的代码,按照代码的意思,都用python写出来了
第一种方法
class ListNode:
def __init__(self, x):
self.val = x
self.next = None
class Solution:
def Merge(self, pHead1, pHead2): # 非递归方法
temp = cur = ListNode(0)
while pHead1 and pHead2: # 对链表的元素进行排序
if pHead1.val <= pHead2.val:
cur.next = pHead1
pHead1 = pHead1.next
else:
cur.next = pHead2
pHead2 = pHead2.next
cur = cur.next
cur.next = pHead1 or pHead2
return temp.next # temp为0,是自己规定的链表头,所以需要从next开始
第二种解法,我还是那句话,能写递归的都是神仙
class ListNode:
def __init__(self, x):
self.val = x
self.next = None
class Solution:
def Merge(self, pHead1, pHead2): # 递归方法
if not pHead1 or not pHead2:
return pHead1 or pHead2
if pHead1.val < pHead2.val:
pHead1.next = self.Merge(pHead1.next, pHead2)
return pHead1
else:
pHead2.next = self.Merge(pHead1, pHead2.next)
return pHead2
第三种方法
class ListNode:
def __init__(self, x):
self.val = x
self.next = None
class Solution:
def Merge(self, pHead1, pHead2): # 递归方法的优化
if pHead1 and pHead2:
if pHead1.val > pHead2.val:
pHead1, pHead2 = pHead2, pHead1
pHead1.next = self.Merge(pHead1.next, pHead2)
return pHead1 or pHead2