合并两个排序的链表

发表于 | 分类于 | 次

###题目

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

解题思路

递归实现。

代码实现

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
# -*- coding:utf-8 -*-
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
p = None
class Solution:
    # 返回合并后列表:递归
    def Merge(self, pHead1, pHead2):
        # write code here
        if pHead1 is None and pHead2 is None:
            return None
        if pHead1 is None:
            return pHead2
        if pHead2 is None:
            return pHead1
        if pHead2.val < pHead1.val:
            p = pHead2
            p.next = self.Merge(pHead1, pHead2.next)
        else:
            p = pHead1
            p.next = self.Merge(pHead1.next, pHead2)
        return p