合并两个排序的链表

最新推荐文章于 2024-02-07 14:30:00 发布

LHN_hpu

最新推荐文章于 2024-02-07 14:30:00 发布

阅读量382

点赞数

分类专栏： C/C++ 数据结构

本文链接：https://blog.csdn.net/LHN_hpu/article/details/52213487

版权

C/C++ 同时被 2 个专栏收录

31 篇文章 0 订阅

订阅专栏

数据结构

30 篇文章 0 订阅

订阅专栏

#include<stdio.h>
#include<stdlib.h>
#include<string.h>

struct Node{
	int m_value;
	Node *m_next;
};
//递归方式 
Node* Merge(Node* pHead1,Node* pHead2){
	if(pHead1==NULL)
	return pHead2;
	elseif(pHead2==NULL)
	return pHead1;	
	Node *Mergelist = NULL;
	if(pHead1->m_value>=pHead2->m_value){
		Mergelist = pHead1;
		Mergelist->m_next = Merge(pHead1->m_next,pHead2);
	}else{
		Mergelist = pHead2;
		Mergelist->m_next = Merge(pHead1,pHead2->m_next);
	}
	return Mergelist;
}
//非递归
Node*  noMerge(Node *pHead1,Node *pHead2){
	if(pHead1==NULL) return pHead2;
	if(pHead2==NULL) return pHead1;
	Node* mergelist = NULL;
	while(pHead1->m_next!=NULL&&pHead2->m_next!=NULL){
		if(pHead1->m_value>=pHead2->m_value){
				if(mergelist==NULL) mergelist = pHead1;
				else  mergelist->m_next = pHead1;
				pHead1 = pHead1->m_next;	
		}else{
				if(mergelist==NULL) mergelist = pHead2;
				else  mergelist->m_next = pHead2;
				pHead2 = pHead2->m_next;
		}
	}
	return mergelist;
}