[C语言] 链表代码

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

//=============================================
#define true   1
#define false  0
#define bool char
#define uint8_t  unsigned char
#define uint16_t unsigned short
#define uint32_t unsigned long
//============================================


typedef struct{
	int data;
	void *pNextNode;
} MyNode;

//链表测试:(创)增删改查

MyNode* LinkInit(int data)
{
	MyNode* head_node = (MyNode*)malloc( sizeof(MyNode));
	if( head_node == NULL)
	{
		printf("Link_Initial,Error! \n");
		return NULL;
	}
	head_node->data = data;
	head_node->pNextNode = NULL;
	return head_node;
}

//追加数据到链表尾部节点数据
//返回最后一个新节点
MyNode* LinkDataAdd( MyNode* headNode ,int data )
{
	MyNode* currNode = headNode;
	MyNode* newNode = (MyNode*)malloc( sizeof(MyNode));
	if( newNode == NULL || currNode == NULL)
	{
		printf("Link_Data_Add,Error! \n");
		return NULL;
	}	
	newNode->data = data;
	newNode->pNextNode = NULL;
	int cnt = 0;
	for(;;)
	{		
		printf("cnt=%d,data=%d.Node_Addr=%p\n",++cnt,currNode->data,currNode );
		if( currNode->pNextNode == NULL )
		{
			currNode->pNextNode = newNode;
			break;
		}
		else
		{
		  currNode = currNode->pNextNode;
		}
	}
	
	return newNode;	
}

//删除链表头的节点数据
//返回当前的新头节点
MyNode* LinkDataDelete( MyNode* headNode )
{

	if( headNode == NULL )
	{
		printf("Link_Data_Delete,Error! \n");
		return 0;
	}	
	MyNode* currNode = headNode->pNextNode;	
	free( headNode );
	headNode = NULL;
	return currNode;
}

void LinkDataShow( MyNode* headNode )
{
	MyNode* currNode = headNode;	
	int cnt = 0;
	for(;;)
	{		
		if(currNode == NULL)
		{
			break;
		}
		printf("#cnt=%d,data=%d.\n",++cnt,currNode->data);
		currNode = currNode->pNextNode;

	}
	
	return ;
}

void main()
{
	printf("__BuildTime=[%s]____\n\n",__TIME__);
	
	MyNode *buff_node = NULL;
	
	MyNode *node = LinkInit(100);
		
	buff_node = LinkDataAdd(node,200);
	printf("Last_node addr = %p.\n\n",buff_node );
	
	buff_node = LinkDataAdd(node,300);
	printf("Last_node addr = %p.\n\n",buff_node );
	
	buff_node = LinkDataAdd(node,400);
	printf("Last_node addr = %p.\n\n",buff_node );
	
	buff_node = LinkDataAdd(node,500);
	printf("Last_node addr = %p.\n\n",buff_node );
	
	LinkDataShow(node);
	
	buff_node = LinkDataDelete(node);
	printf("Head node addr = %p.\n\n",buff_node ); 
    	
}

 待续........

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值