17.合并连个排序的链表

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

直接上代码，可读性强，运行空间较大，牛客网运行时间：36ms  占用内存5760k

# -*- 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):
            return pHead2
        if(pHead2 is None):
            return pHead1
        pHead3 = None
        if(pHead1.val < pHead2.val):
            pHead3 = pHead1
            pHead3.next = self.Merge(pHead1.next , pHead2)
        else:
            pHead3 = pHead2
            pHead3.next = self.Merge(pHead1 , pHead2.next)
        return pHead3