13.链表逆置简单应用

1. 这里只介绍链表逆置的实现
2. 效果展示：
   

typedef struct LIST
{
	int data;
	struct LIST *next;
}list;

void list_addNode(list **pHead)
{
	list *head;
	list *pAdd;//添加的结点
	list *pTmp;//用来保存最后一个结点
	head = *pHead;
	pTmp = NULL;

	int n, i = 0;
	printf("输入多少个数：");
	scanf("%d", &n);
	while (n-- > 0)
	{
		//开辟内存
		pAdd = (list*)malloc(sizeof(list));
		if (pAdd == NULL)
		{
			printf("func addNode() error !\n");
			return;
		}
		//赋值
		pAdd->data = ++i;
		pAdd->next = NULL;
		//创建链表
		if (head == NULL)
		{
			head = pAdd;
		}
		else
		{
			pTmp->next = pAdd;
		}
		//pTmp始终保持在最后一个结点位置，方便新添加的结点的插入
		pTmp = pAdd;
	}
	//间接修改实参头结点的值
	*pHead = head;
}

//打印链表
void list_print(list *head)
{
	list *pTmp = NULL;
	if (head == NULL)
	{
		printf("func list_print() error !\n");
		return;
	}
	pTmp = head;
	printf("Head");
	while (pTmp)
	{
		Sleep(500);
		printf("-> %d ", pTmp->data);
		pTmp = pTmp->next;
	}
	printf("->End\n");
}

• 链表逆置过程
  

//链表逆置函数
void list_inverse(list **pHead)
{
	list *head;
	list *pCur;//当前节点
	list *pPos;//当前节点的下一个结点
	list *pTmp;//保存pPos结点以后的数据
	 
	if (pHead == NULL)
	{
		printf("func list_inverse() error !\n");
		return;
	}
	head = *pHead;
	pCur = head;
	pPos = pCur->next;
	while (pPos)
	{
		pTmp = pPos->next;
		pPos->next = pCur;
		pCur = pPos;
		pPos = pTmp;
	}
	head->next = pPos;
	head = pCur;
	*pHead = head;
}

int _tmain(int argc, _TCHAR* argv[])
{

	list *head = NULL;

	list_addNode(&head);
	list_print(head);

	list_inverse(&head);
	print(head);

	system("pause");
	return 0;
}