剑指Offer（12）——合并两个排序的链表

题目描述
输入两个单调递增的链表，输出两个链表合成后的链表，当然我们需要合成后的链表满足单调不减规则。
利用比较通用的做法：

# -*- coding:utf-8 -*-
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
class Solution:
    def Merge(self, pHead1, pHead2):
        head = ListNode(0)
        move = head
        if not pHead1: return pHead2
        if not pHead2: return pHead1
        while pHead1 and pHead2:
            if pHead1.val < pHead2.val:
                move.next = pHead1
                pHead1 = pHead1.next
            else:
                move.next = pHead2
                pHead2 = pHead2.next
            move = move.next
        move.next = pHead1 if pHead1 else pHead2
        return head.next