剑指offer_16合并两个排序链表（链表）

题目描述

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

解题思路

C++代码实现

C++ clang++3.9

/*
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};*/
class Solution {
public:
    ListNode* Merge(ListNode* pHead1, ListNode* pHead2)
    {
        if(pHead1==nullptr) return pHead2;
        if(pHead2==nullptr) return pHead1;
        
        ListNode* mergeNode=nullptr;
        if(pHead1->val<pHead2->val){
            mergeNode=pHead1;
            mergeNode->next=Merge(pHead1->next,pHead2);
        }
        else{
            mergeNode=pHead2;
            mergeNode->next=Merge(pHead1,pHead2->next);
        }
        return mergeNode;
    }
};

运行时间：3ms
占用内存：608k

python代码实现

python 2.7.3

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

运行时间：25ms
占用内存：5728k