面試25題：
題目：合並兩個排序的鏈表

題：輸入兩個單調遞增的鏈表，輸出兩個鏈表合成後的鏈表，當然我們需要合成後的鏈表滿足單調不減規則。

解題思路：遞歸，並需註意對空鏈表單獨處理。

解題代碼：

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

劍指offer 面試25題