牛客66道编程题——合并两个排序的列表

题目

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

方法一：非递归法

# -*- 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==None:
            return pHead2
        if pHead2==None:
            return pHead1
        
        #定义一个指向表头的指针，但是不确定这个指向表头的指针是指向pHead1的表头还是pHead2的表头
        newHead=pHead1 if pHead1.val<pHead2.val else pHead2
        
        #定义两个进行判断的判断指针
        pTmp1=pHead1
        pTmp2=pHead2
        
        #判断指向表头的指针是指向哪一个表头
        if newHead==pTmp1:#若指向表头1
            pTmp1=pTmp1.next#则判断指针1指向下一个值
        else:
            pTmp2=pTmp2.next#否则判断指针2指向下一个值
            
        previousPointer=newHead#定义一个起连接作用的指针
        
        #利用指针合并链表
        while pTmp1 and pTmp2:
            if pTmp1.val<pTmp2.val:#若判断指针1指向的值更加小
                previousPointer.next=pTmp1#连接指针和判断指针1指向的值相连
                previousPointer=pTmp1#连接指针指向判断指针1指向的位置
                pTmp1=pTmp1.next#判断指针指向下一个值
            else:
                previousPointer.next=pTmp2
                previousPointer=pTmp2
                pTmp2=pTmp2.next
                
        if pTmp1== None:
            previousPointer.next=pTmp2
        else:
            previousPointer.next=pTmp1
            
        return newHead
       

方法二：递归法

class Solution:
    # 返回合并后列表
    def Merge(self, pHead1, pHead2):
        # write code here
        if pHead1==None:
            return pHead2
        if pHead2==None:
            return pHead1
        if pHead1.val<=pHead2.val:
            pHead1.next=self.Merge(pHead1.next,pHead2)
            return pHead1
        if pHead1.val>=pHead2.val:
            pHead2.next=self.Merge(pHead1,pHead2.next)
            return pHead2

方法三

class Solution:
    # 返回合并后列表
    def Merge(self, pHead1, pHead2):
        # write code here
        tmp = ListNode(0)
        pHead = tmp       
        while pHead1 and pHead2:
            if pHead1.val < pHead2.val:
                tmp.next = pHead1
                pHead1 = pHead1.next
            else:
                tmp.next = pHead2
                pHead2 = pHead2.next
            tmp = tmp.next
        if not pHead1:
            tmp.next = pHead2
        if not pHead2:
            tmp.next = pHead1
        return pHead.next