剑指offer 合并链表 Python实现

题目

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

输入

[1,3,5],[2,4,6]

输出

[1,2,3,4,5,6]

解法1

直观的办法，先找到头节点，然后遍历至一个链表遍历结束，随后直接连上另外一个有空余的链表

# -*- coding:utf-8 -*-
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
class Solution:
    # 返回合并后列表
    def Merge(self, pHead1, pHead2):
        if not pHead1:
            return pHead2
        if not pHead2:
            return pHead1 #排除有一个是空列表的情况
        if pHead1.val <= pHead2.val:
            pHead = pHead1
            pHead1 = pHead1.next
        else:
            pHead = pHead2
            pHead2 = pHead2.next
        p = pHead
        while pHead1 and pHead2:
            if pHead1.val <= pHead2.val:
                p.next = pHead1
                p = pHead1
                pHead1 = pHead1.next
            else:
                p.next = pHead2
                p = pHead2
                pHead2 = pHead2.next
        while pHead1:
            p.next = pHead1
            p = pHead1
            pHead1 = pHead1.next
        while pHead2:
            p.next = pHead2
            p = pHead2
            pHead2 = pHead2.next
        return pHead

解法2

使用递归

# -*- coding:utf-8 -*-
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
class Solution:
    # 返回合并后列表   
    def Merge(self, pHead1, pHead2):
        if not pHead1:
            return pHead2
        if not pHead2:
            return pHead1 #排除有一个是空列表的情况
        pMergeHead = None
        if pHead1.val <= pHead2.val:
            pMergeHead = pHead1
            pMergeHead.next = self.Merge(pHead1.next, pHead2)
        else:
            pMergeHead = pHead2
            pMergeHead.next = self.Merge(pHead1, pHead2.next)
        return pMergeHead