合并两个排序的链表

[编程题]合并两个排序的链表

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

参考代码：

# -*- coding:utf-8 -*-# class ListNode:#     def __init__(self, x):#         self.val = x#         self.next = Noneclass Solution:    # 返回合并后列表    def Merge(self, pHead1, pHead2):        # write code here        p1 = pHead1        p2 = pHead2        if p1 == None:            return p2        if p2 == None:            return p1        if p1.val < p2.val:            p3 = p1            p1 = p1.next        else:            p3 = p2            p2 = p2.next        h = p3        while(1):            if p1 == None:                p3.next = p2                break            if p2 == None:                p3.next = p1                break                             if p1.val < p2.val:                p3.next = p1                p3 = p1                p1 = p1.next            else:                p3.next = p2                p3 = p2                p2 = p2.next        return h