判断链表是否为空、排序、插入、删除

判断链表是否为空、排序、插入、删除

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

typedef struct Node                  // 定义链表每一个节点的类型
{
	int data;                        // 数据域
	struct Node * pNext;             // 指针域
}NODE, *PNODE;                       // NODE相当于struct Node类型；PNODE相当于struct Node *类型


//  前置函数声明
PNODE  creat_list(void);
void traverse_list(PNODE pHead);
int length_list(PNODE pHead);
bool is_empty(PNODE pHead);
void sort_list(PNODE pHead);
bool insert_list(PNODE pHead, int pos, int val);
bool delete_list(PNODE pHead, int pos, int * pval);

// 主函数
int main(void)
{
	PNODE pHead = NULL; 
	int val = 0;

	pHead = creat_list();
	
//	printf("链表的长度为len = %d\n", length_list(pHead));
	if(is_empty(pHead))
		printf("链表为空!\n");
	else
		printf("链表不为空!\n");

	sort_list(pHead);
//	insert_list(pHead, 3, 5);
	delete_list(pHead, 3, &val);
	traverse_list(pHead);

	return 0;
}

// 创建链表函数

PNODE  creat_list(void)
{
	int len; 
	int i; 
	int val;

	printf("请输入链表的长度：len = ");
	scanf("%d", &len);

	PNODE pHead = (PNODE)malloc(sizeof(NODE));    // 动态分配内存
	if(NULL == pHead)
	{
		printf("内存分配失败，终止程序!\n");
		exit(-1);
	}

	PNODE pTail = pHead;
	pTail->pNext = NULL;
	
	for(i = 0; i < len; i++)
	{

		printf("请输入第%d个节点的数据：", i+1);
		scanf("%d", &val);

		PNODE pNew = (PNODE)malloc(sizeof(NODE));
		if(NULL == pNew)
		{
			printf("内存分配失败，终止程序!\n");
			exit(-1);
		}

		pNew->data = val;
		pNew->pNext = NULL;
		pTail->pNext = pNew;
		pTail = pNew;

	}

	return pHead;
}

// 遍历链表函数 

void traverse_list(PNODE pHead)
{
	PNODE p = pHead->pNext;

	while(NULL != p)
	{
		printf("%d  ", p->data);
		p = p->pNext;
	}
	printf("\n");
	return;
}

// 计算链表的长度函数

int length_list(PNODE pHead)
{
	PNODE p = pHead->pNext;
	int len = 0;

	while(NULL != p)
	{
		len++;
		p = p->pNext;
	}
	return len;
}

// 判断链表是否为空函数
 
bool is_empty(PNODE pHead)
{
	if(NULL == pHead->pNext)
		return true;
	else
		return false;
}

// 对链表进行排序函数

void sort_list(PNODE pHead)
{
	int i, j, t, len = length_list(pHead);
	PNODE p, q;
	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->data > q->data )
			{
				t = p->data ;
				p->data = q->data ;
				q->data = t ;
			}
		}

	}
	return;
}


// 在链表的第pos个元素前面插入元素val；
bool insert_list(PNODE pHead, int pos, int val)
{
	int i = 0;
	PNODE p = pHead;

	while(NULL != p && i < pos-1)
	{
		p = p->pNext ;
		i++;
	}

	if(i > pos-1 || NULL == p)
		return false;

	PNODE pNew = (PNODE)malloc(sizeof(NODE));
	if(NULL == pNew)
	{
		printf("内存分配失败!\n");
		exit(-1);
	}
	pNew->data = val;
	PNODE q = p->pNext;
	p->pNext = pNew;
	pNew->pNext = q;
	return true;
}

// 删除第pos个链表元素
bool delete_list(PNODE pHead, int pos, int * pval)
{
	PNODE p = pHead;
	int i = 0;

	while(NULL != p->pNext  && i < pos-1)
	{
		p = p->pNext ;
	    i++;
	}
	if(i > pos-1 || NULL == p->pNext )
		return false;

	PNODE q = p->pNext ;
	*pval = q->data ;

	p->pNext = p->pNext->pNext ;
	free(q);
	q = NULL;
	
	return true;
}