链表：按序号插入、删除

最新推荐文章于 2020-10-24 21:10:29 发布

Hustudent20080101

最新推荐文章于 2020-10-24 21:10:29 发布

阅读量691

点赞数

CC 4.0 BY-SA版权

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

本文链接：https://blog.youkuaiyun.com/autumn20080101/article/details/7529137

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

232 篇文章

订阅专栏

数据结构与算法

104 篇文章

订阅专栏

// ListTable.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <string.h>

typedef struct _Node
{
	_Node(char *varname,_Node& prev,int isNexttoSb=1)
	{
		memset(name,0,256);
		strcpy(name,varname);
		if(isNexttoSb)
		prev.pNext=this;
		pNext=NULL;
	}
	_Node(char *varname)
	{
		memset(name,0,256);
		strcpy(name,varname);
		pNext=NULL;
	}
	char name[256];
	struct _Node* pNext;

}Node,*PNode;

void printAll(PNode pnode)
{
	do
	{
		printf("%s\n",pnode->name);
		pnode=pnode->pNext;
	}while(pnode!=NULL);
}
char* getName(PNode pnode,int index)
{
	if(index<0)return NULL;	
	for(int i=0;i<index;i++)
	{
		pnode=pnode->pNext;
		if(pnode==NULL)
			return NULL;
	}
	return pnode->name;
}

PNode getNode(PNode pnode,int index)
{
	if(index<0)return NULL;
	for(int i=0;i<index;i++)
	{
		pnode=pnode->pNext;
		if(pnode==NULL)
			return NULL;
	}
	return pnode;
}

void InsertNode(PNode pPrenode,Node& node)
{
	node.pNext=pPrenode->pNext;
	pPrenode->pNext=&node;
}

PNode InsertNode(PNode pFirstnode,Node& node,int index)
{
	PNode pPrenode=getNode(pFirstnode,index-1);
	if(pPrenode==NULL) return NULL;
	InsertNode(pPrenode,node);
	return &node;
}

PNode RemoveNode(PNode  pPrenode)
{
	PNode nodeRemoved=pPrenode->pNext;
	pPrenode->pNext=nodeRemoved->pNext;
	return nodeRemoved;

}

PNode RemoveNode(PNode pFirstnode,int index)
{
	PNode pPrenode=getNode(pFirstnode,index-1);
	if(pPrenode==NULL) return NULL;
	
	return RemoveNode(pPrenode);

}

int main(int argc, char* argv[])
{
	Node zhao("zhao",*(reinterpret_cast<Node*>(NULL)),0);
	PNode pFirst=&zhao;
	Node qian("qian",zhao);
	Node shun("shun",qian);
	Node li("li",shun);

	printAll(pFirst);

	for(int i=0;i<10;i++)
	printf("%s ",getName(pFirst,i));
	printf("\n");

	Node zhou("zhou");
    InsertNode(&qian,zhou);
	printAll(pFirst);
	printf("===============\n");
	RemoveNode(&shun);
	printAll(pFirst);
	printf("===============\n");
	printf("加入wu:1========\n");
	Node wu("wu");
	InsertNode(pFirst,wu,1);
	printAll(pFirst);
	printf("===============\n");
	printf("删除:1=========\n");
    RemoveNode(pFirst,1);
	printAll(pFirst);
	printf("===============\n");
	printf("Hello World!\n");
	return 0;
}

zhao
qian
shun
li
zhao qian shun li (null) (null) (null) (null) (null) (null)
zhao
qian
zhou
shun
li
===============
zhao
qian
zhou
shun
===============
加入wu:1========
zhao
wu
qian
zhou
shun
===============
删除:1=========
zhao
qian
zhou
shun
===============
Hello World!
Press any key to continue