反转一个链表。递归算法

最新推荐文章于 2024-09-18 20:33:32 发布

Hustudent20080101

最新推荐文章于 2024-09-18 20:33:32 发布

阅读量685

点赞数

分类专栏： C++ 基础数据结构与算法文章标签：算法 list null

本文链接：https://blog.csdn.net/autumn20080101/article/details/7537909

版权

C++ 基础同时被 2 个专栏收录

232 篇文章 3 订阅

订阅专栏

数据结构与算法

104 篇文章 5 订阅

订阅专栏

//2、反转一个链表。递归算法。    
#include <stdio.h>  
#include <string.h>

struct List
{
	List(char * name)
	{
		strcpy(this->name,name);
		pnext=NULL;
	}
	List* InsertSbAfterMe(List* Sb)
	{
		Sb->pnext=this->pnext;
		this->pnext=Sb;
		return Sb;
	}

	char name[256];
	List* pnext;
};
List* printAll(List* Plist); 
List*   resverse(List*   l);
List*   Myreverse(List*   I,bool isFirstTwo=false);   
void main()
{
    List* PlistA=new List("zhao");
	List* tmpList=PlistA->InsertSbAfterMe(new List("qian"));
	tmpList=tmpList->InsertSbAfterMe(new List("shun"));
	tmpList=tmpList->InsertSbAfterMe(new List("Li"));
	printf("printAll(PlistA)\n");
	printAll(PlistA);
//
	List* PlistB=resverse(PlistA);
	printf("printAll(PlistB)\n");
	printAll(PlistB);
	//*
	List* PlistC=Myreverse(PlistB,true);
	printf("printAll(PlistC)\n");
	printAll(PlistC);
	//*/
}

List* printAll(List* Plist)
{
	List* walker=Plist;
	while(walker)
	{
		printf("%s ",walker->name);
		walker=walker->pnext;
	}
	printf("\n");
	return Plist;
}

List*   resverse(List*   l)   
{
	static int counter=0;
	printf("%d\n",++counter);
    if(!l   ||   !l->pnext)   return   l;   
	       
        List*   n   =   resverse(l->pnext);   
        l->pnext->pnext   =   l;   
        l->pnext=NULL;   
    return   n;   
}   

List*   MyRev(List*   I)   
{ 
	static int counter=0;
	printf("%d\n",++counter);
    if(!I   ||   !I->pnext)   return   I;   

	List* OIdI=I;
	List* NewI=I->pnext;
    List*   n   = MyRev(NewI);       
    NewI->pnext   =  OIdI;   
    OIdI->pnext=NULL;   
    return  n;  
} 

List*   Myreverse(List*   I,bool isFirstTwo)   
{
    if(!I || !I->pnext)return I;
	List*   OldI=I;
	List*   NewI=I->pnext;
	//*
	if(isFirstTwo)
	{
	OldI->pnext=NULL;
	isFirstTwo=false;
	}
	//*/

	List* theLast=Myreverse(NewI);
	NewI->pnext=OldI;
	//OldI->pnext=NULL;

	return theLast;
}