知识点:链表,递归
一、题目描述:
输入两个单调递增的链表,输出两个链表合成后的链表,当然我们需要合成后的链表满足单调不减规则。
二、思路分析:
以以下链表1和链表2为例:
合并过程分析:首先确定合并后链表的头节点,然后采用递归方法不断比较链表1和链表2剩下的节点的值得大小
三、代码实现:
C++:
/*
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==NULL){
return pHead2;
}
if(pHead2==NULL){
return pHead1;
}
ListNode* node = NULL;
if(pHead1->val < pHead2->val){
node = pHead1;//pHead1作为合并后链表的头节点
node->next = Merge(pHead1->next,pHead2);
}
else{
node = pHead2;//pHead2作为合并后链表的头节点
node->next = Merge(pHead2->next,pHead1);
}
return node;
}
};
python:
# -*- 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
node = None
if pHead1.val<pHead2.val:
node = pHead1
node.next = self.Merge(pHead1.next,pHead2)
else:
node = pHead2
node.next = self.Merge(pHead2.next,pHead1)
return node