c语言创建链表

使用malloc函数动态分配内存创建链表，可以手动释放内存，顺便练习一下C语言数据结构。

1.数据结构

typedef struct node{
	int date;//数据域
	struct node * pNext;//指针域
	
}NODE, *PNODE;

2.链表初始化

//创建链表，返回链表的头指针 
PNODE create_list(void)
{
	int len;
	int val;
	PNODE pNew = NULL;
	PNODE pTail = NULL;
	PNODE pHead = NULL;
	pHead = (PNODE)malloc(sizeof(NODE));
	pTail = pHead;
	pTail->pNext = NULL;
	if(pHead == NULL)
	{
		printf("内存分配失败！\n");
		exit(-1);
	}
	printf("请输入创建节点的个数：");
	scanf("%d", &len);
	for(int i = 0; i < len; i++)
	{
		printf("请输入第%d个节点的值:", i+1);
		scanf("%d", &val);
		pNew = (PNODE)malloc(sizeof(NODE));
		if(pNew == NULL)
		{
			printf("内存分配失败！\n");
			exit(-1);
		}
		pNew->date = val;
		pNew->pNext = NULL;
		pTail->pNext = pNew;
		pTail = pTail->pNext; 
	}
	return pHead;
}

3.遍历链表

//遍历输出链表 
void traverse_list(PNODE pHead)
{
	PNODE p = pHead->pNext;
	while(p != NULL)
	{
		printf("%d ", p->date);
		p = p->pNext;
	}
	printf("\n");
	return;
	
}

4.排序（冒泡排序）

//链表排序 
void sort_list(PNODE pHead)
{
	int i, j, t, len;
	PNODE p,q;
	len = length_list(pHead);
	for(i = 0, p = pHead->pNext; i < len-1; i++, p = p->pNext)
	{
		for(j = i+1, q = p->pNext; j < len; j++, q = q->pNext)
		{
			if(p->date > q->date)
			{
				t = p->date;
				p->date = q->date;
				q->date = t;
			}
		}
	 } 
	 return;
}

5.插入元素

//插入元素，p为插入元素的前一个位置 
bool insert_list(PNODE pHead, int pos, int val)
{
	int i = 0;
	PNODE p = pHead;
	while(p != NULL && i < pos-1)
	{
		p = p->pNext;
		i++;
		
	}
	if(p == NULL && i > pos-1)
	{
		return false;
	}
	PNODE pNew = (PNODE)malloc(sizeof(NODE));
	if(pNew == NULL)
	{
		printf("内存分配失败\n");
		exit(-1);
		
	}
	
	pNew->date = val;
	PNODE q = p->pNext;
	p->pNext = pNew;
	pNew->pNext = q;
	return true;
	
}

6.删除元素

//删除元素，p为删除元素的前一个元素 
bool delete_list(PNODE pHead, int pos, int * val)
{
	int i = 0;
	PNODE p = pHead;//p最终指向要删除元素的前一个节点 
	while(p->pNext != NULL && i < pos-1)
	{
		p = p->pNext;
		i++;
		
	}
	if(p->pNext == NULL && i > pos-1)
	{
		return false;
	}
	//177~186行是可以使p指向第pos-1个元素 
	
	PNODE q = p->pNext;
	*val = q->date;
	
	
	p->pNext = p->pNext->pNext;
	free(q);
	q = NULL;
	return true;
}

7.完整代码

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


typedef struct node{
	int date;//数据域 
	struct node * pNext;//指针域 
	
}NODE, *PNODE;

//声明函数
PNODE create_list(void); //创建链表 
void traverse_list(PNODE pHead);//遍历链表 
bool is_empty(PNODE pHead);//链表是否为空 
int length_list(PNODE pHead);//链表的长度 
void sort_list(PNODE pHead);//链表排序 
bool insert_list(PNODE pHead, int pos, int val);//在指定位置插入元素 
bool delete_list(PNODE pHead, int pos, int * val);//删除指定位置的元素 


int main(void)
{
	int val;
	
	PNODE pHead = NULL;
	pHead = create_list();//初始化链表 
	printf("当前链表为："); 
	traverse_list(pHead);//遍历并输出链表 
	int len = length_list(pHead);//得到链表的长度 
	printf("链表长度为："); 
	printf("%d\n", len); 
	printf("排序："); 
	sort_list(pHead);//链表排序 
	traverse_list(pHead);
	printf("插入元素后链表为："); 
	insert_list(pHead, 2, 99);//插入元素 
	traverse_list(pHead);
	printf("删除元素后链表为："); 
	delete_list(pHead, 2, &val);//删除元素 
	traverse_list(pHead);
	return 0;	
} 


//创建链表，返回链表的头指针 
PNODE create_list(void)
{
	int len;
	int val;
	PNODE pNew = NULL;
	PNODE pTail = NULL;
	PNODE pHead = NULL;
	pHead = (PNODE)malloc(sizeof(NODE));
	pTail = pHead;
	pTail->pNext = NULL;
	if(pHead == NULL)
	{
		printf("内存分配失败！\n");
		exit(-1);
	}
	printf("请输入创建节点的个数：");
	scanf("%d", &len);
	for(int i = 0; i < len; i++)
	{
		printf("请输入第%d个节点的值:", i+1);
		scanf("%d", &val);
		pNew = (PNODE)malloc(sizeof(NODE));
		if(pNew == NULL)
		{
			printf("内存分配失败！\n");
			exit(-1);
		}
		pNew->date = val;
		pNew->pNext = NULL;
		pTail->pNext = pNew;
		pTail = pTail->pNext; 
	}
	return pHead;
	
	
}

//遍历输出链表 
void traverse_list(PNODE pHead)
{
	PNODE p = pHead->pNext;
	while(p != NULL)
	{
		printf("%d ", p->date);
		p = p->pNext;
	}
	printf("\n");
	return;
	
}

//判断链表是否为空 
bool is_empty(PNODE pHead)
{
	if(pHead->pNext == NULL)
	{
//		printf("链表为空！\n");
		return true;
	}
	else
	{
		return false;
	}
}
//返回链表的长度 
int length_list(PNODE pHead)
{
	int length = 0;
	PNODE p = pHead->pNext;
	while(p != NULL)
	{
		length++;
		p = p->pNext;
	}
	return length;
}

//链表排序 
void sort_list(PNODE pHead)
{
	int i, j, t, len;
	PNODE p,q;
	len = length_list(pHead);
	for(i = 0, p = pHead->pNext; i < len-1; i++, p = p->pNext)
	{
		for(j = i+1, q = p->pNext; j < len; j++, q = q->pNext)
		{
			if(p->date > q->date)
			{
				t = p->date;
				p->date = q->date;
				q->date = t;
			}
		}
	 } 
	 return;
}

//插入元素，p为插入元素的前一个位置 
bool insert_list(PNODE pHead, int pos, int val)
{
	int i = 0;
	PNODE p = pHead;
	while(p != NULL && i < pos-1)
	{
		p = p->pNext;
		i++;
		
	}
	if(p == NULL && i > pos-1)
	{
		return false;
	}
	PNODE pNew = (PNODE)malloc(sizeof(NODE));
	if(pNew == NULL)
	{
		printf("内存分配失败\n");
		exit(-1);
		
	}
	
	pNew->date = val;
	PNODE q = p->pNext;
	p->pNext = pNew;
	pNew->pNext = q;
	return true;
	
}

//删除元素，p为删除元素的前一个元素 
bool delete_list(PNODE pHead, int pos, int * val)
{
	int i = 0;
	PNODE p = pHead;//p最终指向要删除元素的前一个节点 
	while(p->pNext != NULL && i < pos-1)
	{
		p = p->pNext;
		i++;
		
	}
	if(p->pNext == NULL && i > pos-1)
	{
		return false;
	}
	//177~186行是可以使p指向第pos-1个元素 
	
	PNODE q = p->pNext;
	*val = q->date;
	
	
	p->pNext = p->pNext->pNext;
	free(q);
	q = NULL;
	return true;	
}