c语言合并两个链表 排序,合并两个排序的链表 - FollowMee的个人空间 - OSCHINA - 中文开源技术交流社区...

合并两个排序的链表

题目内容：输入两个单调递增的链表，输出两个链表合成后的链表，当然我们需要合成后的链表满足单调不减规则

解法：

遍历两个链表，借鉴归并排序合并子序列的方法合并两个链表

# -*- coding:utf-8 -*-

# class ListNode:

# def __init__(self, x):

# self.val = x

# self.next = None

class Solution:

# 返回合并后列表

def Merge(self, pHead1, pHead2):

# write code here

if pHead1 is None and pHead2 is None:

return None

elif pHead1 is None:

return pHead2

elif pHead2 is None:

return pHead1

else:

if pHead1.val < pHead2.val:

p = q = pHead1

pHead1 = pHead1.next

else:

p = q = pHead2

pHead2 = pHead2.next

while pHead1 and pHead2:

if pHead1.val < pHead2.val:

q.next = pHead1

q = q.next

pHead1 = pHead1.next

else:

q.next = pHead2

q = q.next

pHead2 = pHead2.next

if pHead1:

q.next = pHead1

if pHead2:

q.next = pHead2

return p

使用递归的方法

# -*- coding:utf-8 -*-

# class ListNode:

# def __init__(self, x):

# self.val = x

# self.next = None

class Solution:

# 返回合并后列表

def Merge(self, pHead1, pHead2):

# write code here

if not pHead1:

return pHead2

if not pHead2:

return pHead1

if pHead1.val < pHead2.val:

pHead1.next = self.Merge(pHead1.next, pHead2)

return pHead1

else:

pHead2.next = self.Merge(pHead1, pHead2.next)

return pHead2