数据结构之链表的用法

 基于上篇单向链表的补充

1.运用快慢指针查找链表的结点

Link_node *find_mid_node(Link_node *phead)
{
	Link_node *pfast = phead->pnext;
	Link_node *pslow = pfast;

	while (pfast != NULL)
	{
		pfast = pfast->pnext;
		if (NULL == pfast)
		{
			return pslow;
		}
		pfast = pfast->pnext;
		pslow = pslow->pnext;

	}
	
	return pslow;
}

寻找给定指定位置的结点

Link_node *find_last_K_node(Link_node *phead, int K)
{	
	Link_node *pfast = phead->pnext;
	Link_node *pslow = pfast;

	for (int i = 0; i < K; i++)
	{
		if (NULL == pfast)
		{
			return NULL;
		}
		pfast = pfast->pnext;
	}
	
	while (pfast != NULL)
	{
		pfast = pfast->pnext;
		pslow = pslow->pnext;
	}
	
	return pslow;
}

2 检查 链表是否泄露

 sudo apt-get install valgrind

valgrind ./a.out

valgrind：程序运行过程中检查是否发生了内存泄漏 

3 插入排序

思想:将结点依次插入到一个有序链表中，确保插入之后任然有序。

具体代码如下:

void insert_sort_link(Link_node *phead)
{
	if (is_empty_link(phead))
	{
		return ;
	}
	Link_node *ptmp = phead->pnext->pnext;
	phead->pnext->pnext = NULL;
	Link_node *pinsert = NULL;
	Link_node *p = NULL;
	

	while (ptmp != NULL)
	{
		pinsert = ptmp;
		ptmp = ptmp->pnext;

		p = phead;
		while (p->pnext != NULL && p->pnext->data < pinsert->data)
		{
			p = p->pnext;
		}
		pinsert->pnext = p->pnext;
		p->pnext = pinsert;

	}
}	

认识双向链表

1.双向链表与单向链表的区别

掌握双向链表的API：应用程序接口(增删查改)

下篇将会更新具体操作与应用