刷题--合并两个排序的链表

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

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

            return pMergedHead

非递归版本：

class Solution:
    # 返回合并后列表
    def Merge(self, pHead1, pHead2):
        # write code here
        if pHead1 == None:
              return pHead2
        elif pHead2 == None:
              return pHead1
        else:
            p1, p2 = pHead1, pHead2
            pMergedHead = None

            while p1 and p2:
                if p1.val < p2.val:
                    if pMergedHead == None:
                        pMergedHead = p1
                        current = p1
                    else:
                        current.next = p1
                        current = current.next

                    p1 = p1.next
                else:
                    if pMergedHead == None:
                        pMergedHead = p2
                        current = p2
                    else:
                        current.next = p2
                        current = current.next

                    p2 = p2.next

            if p1:
                current.next = p1
            else:
                current.next = p2

        return pMergedHead