数据结构之非循环单链表的基本操作（C语言实现）

非循环单链表的基本操作（C语言实现）

（一）创建

PNODE create_list()
{
	int len;//用来存放有效节点的个数
	int i;
	int val;//用来存放用户输入的节点值
	
	//分配了一个不存放有效数据的头节点

	PNODE pHead = (PNODE)malloc(sizeof(NODE));
	if (NULL == pHead)
	{
		printf("分配失败，程序终止！\n");
		exit(-1);
	}
	PNODE pTail = pHead;
	pTail->pNext = NULL;

	printf("请输入您要输入的节点个数：len=");
	scanf_s("%d", &len);

	for (i = 0; i < len; ++i)
	{
		printf("请输入第%d个节点的值：",i + 1);
		scanf_s("%d", &val);

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

（二）遍历

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

（三）判空

bool is_empty(PNODE pHead)
{
	if (NULL == pHead->pNext)
		return true;
	else
		return false;
}

（四）求链表的长度

int length_list(PNODE pHead)
{
	PNODE p=pHead->pNext;
	int len = 0;
	while (NULL != p)
	{
		++len;
		p = p->pNext;
	}
	return len;
}

（五）排序

void sort_list(PNODE pHead)
{
	int i, j, t;
	PNODE p, q;
	for (i = 0, p = pHead->pNext; i < length_list(pHead) - 1; i++, p = p->pNext)
	{
		for (j = i + 1, q = p->pNext; j < length_list(pHead); j++, q = q->pNext)
		{
			if (p->data > q->data)
			{
				t = p->data;
				p->data = q->data;
				q->data = t;
			}

		}
	}
}

（六）插入

要求：在第pos个节点前面插入元素val

bool insert_list(PNODE pHead, int pos, int val)
{
	int i = 0;
	PNODE p = pHead;
	while (p != NULL && i < pos - 1)//p指向第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* val) {

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

	PNODE q = p->pNext;
	p->pNext = q->pNext;
	*val = q->data;
	free(q);
	q = NULL;


	return true;

}

学习ing！