合并两个排序的列表

题目描述

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

生写：

# -*- 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 not pHead1: return pHead2
        if not pHead2: return pHead1
        
        if pHead1.val <= pHead2.val:
            head = pHead1
            p = pHead2
        else:
            head = pHead2
            p = pHead1
        pHead = head
        while p and head.next:
            if head.next.val <= p.val:
                head = head.next
            else:
                q = p.next
                next = head.next
                p.next = next
                head.next = p
                p = q
        if p:
            head.next = p
        return pHead