链表入门代码

看B站郝斌老师视频，自己动手码的。

#include<stdio.h>
#include<malloc.h>
#include<stdlib.h>
#include<string.h>
typedef struct student {
	int data;
	struct student* pNext;
}NODE, * PNODE;
PNODE create_list();
void reverse_list(PNODE);
int is_empty(PNODE pHead);
int length_list(PNODE pHead);
int insert_list(PNODE pHead, int pos, int val);
int delete_list(PNODE pHead, int pos, int* pVal);
int main()
{
	int count = 0;
	PNODE pHead = NULL;
	pHead = create_list();
	reverse_list(pHead);
	if (is_empty(pHead))
	{
		printf("链表非空\n");
	}
	else
	{
		printf("链表为空\n");
	}
	count = length_list(pHead);
	printf("链表的长度是%d\n", count);
	return 0;
}
PNODE create_list()
{
	int i;
	int len;
	int val;
	PNODE pHead = (PNODE)malloc(sizeof(NODE));
	if (pHead == NULL)
	{
		printf("内存分配失败 ！\n");
		exit(-1);
	}
	PNODE pTail = pHead;
	pTail->pNext = NULL;
	printf("请输入您需要生成的链表节点的个数：len= ");
	scanf("%d", &len);
	for (i = 0; i < len; i++)
	{
		printf("请输入第%d个结点的值： ", i + 1);
		scanf("%d", &val);
		PNODE pNew = (PNODE)malloc(sizeof(NODE));
		if (pNew == NULL)
		{
			printf("内存分配失败！\n");
			exit(-1);
		}
		pNew->data = val;
		pTail->pNext = pNew;
		pNew->pNext = NULL;
		pTail = pNew;
	}
	return pHead;
}
void reverse_list(PNODE pHead)
{
	PNODE p = pHead->pNext;
	while (p!=NULL)
	{
		printf("%d ", p->data);
		p = p->pNext;
	}
	printf("\n");
}
int is_empty(PNODE pHead)
{
	if (pHead->pNext == NULL)
	{
		return 0;
	}
	else
	{
		return 1;
	}
}
int length_list(PNODE pHead)
{
	int count = 0;
	PNODE p = pHead->pNext;
	if (p != NULL)
	{
		count++;
		p = p->pNext;
	}
	return count;
}
int 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 (i > pos - 1 || p == NULL)
	{
		return 0;
	}
	PNODE pNew = (PNODE)malloc(sizeof(NODE));
	if (pNew == NULL)
	{
		printf("内存分配失败！\n");
		exit(-1);
	}
	PNODE q = p->pNext;
	p->data = val;
	p->pNext = pNew;
	pNew->pNext = q;	
	return 1;
}
int delete_list(PNODE pHead, int pos, int* pVal)
{
	int i = 0;
	PNODE p = pHead->pNext;
	while (p->pNext != NULL && i < pos - 1)
	{
		p = p->pNext;
		i++;
	}
	if (i > pos - 1 || p->pNext == NULL)
	{
		return 0;
	}
	PNODE q = p->pNext;
	*pVal = q->data;
	p->pNext = p->pNext->pNext;
	free(q);
	q = NULL;
	return 1;
}