剑指offer（16）

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

要记得固定一个指针在链表头，一个指针随着新插入的数往后走

 

# -*- 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
        p = ListNode(0)
        m = p
        while(pHead1 and pHead2):
            if(pHead1.val>=pHead2.val):
                p.next = pHead2
                pHead2 = pHead2.next
            else:
                p.next = pHead1
                pHead1 = pHead1.next
            p = p.next
        if(pHead1):
            p.next = pHead1
        else:
            p.next = pHead2
        m = m.next
        return m