剑指offer（十六）：合并两个排序的链表 递归方法python版详解

最近刷题发现我真是个菜鸡，看书人家都说这道题hen简单我们这样这样就好然后直接贴代码，奈何我这样都看不懂，尤其是有的题的递归解法，我全是啥玩意儿啊？咋回事儿啊？？所以自己画画图给自己康康…

递归代码

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

递归详解