題目

輸入兩個(gè)單調(diào)遞增的鏈表，輸出兩個(gè)鏈表合成后的鏈表，當(dāng)然我們需要合成后的鏈表滿足單調(diào)不減規(guī)則。

思路

基本思路很簡單，新建一個(gè)頭結(jié)點(diǎn)new_head，然后每次比較兩個(gè)鏈表的頭結(jié)點(diǎn)，把小的結(jié)點(diǎn)鏈到新頭結(jié)點(diǎn)的后面

代碼

非遞歸版本

# -*- 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 = new_head = ListNode(None)
        while True:
            if not pHead1:
                new_head.next = pHead2
                break
            if not pHead2:
                new_head.next = pHead1
                break
            if pHead1.val <= pHead2.val:
                new_head.next = pHead1
                pHead1 = pHead1.next
            else:
                new_head.next = pHead2
                pHead2 = pHead2.next
            new_head = new_head.next
        return p.next

遞歸版本

# -*- 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

        new_head = None
        if pHead1.val <= pHead2.val:
            new_head = pHead1
            new_head.next = self.Merge(pHead1.next, pHead2)
        else:
            new_head = pHead2
            new_head.next = self.Merge(pHead2.next, pHead1)
        return new_head