单链表的反转

最新推荐文章于 2023-05-16 13:54:02 发布

SelfLink

最新推荐文章于 2023-05-16 13:54:02 发布

阅读量413

点赞数

分类专栏： C/C++ 算法文章标签：单链表 c++

本文链接：https://blog.csdn.net/zpxili/article/details/26060789

版权

C/C++ 同时被 2 个专栏收录

38 篇文章 0 订阅

订阅专栏

算法

19 篇文章 0 订阅

订阅专栏

void InitList(Node *pHead)
{
	Node* pList = pHead;
	
	int i = 0;
	for(; i < 10; i++)
	{
		Node *pNode = new Node;
		pNode->data = i;
		pNode->next = NULL;
		pList->next = pNode;
		pList = pNode;
	} 
}

void PrintList(Node *pHead)
{
	Node* pList = pHead->next;
	while(pList)
	{
		printf("%d-",pList->data);
		pList = pList->next;
	}
	printf("\r\n");
}

void ReleaseList(Node *pHead)
{
	Node* pList = pHead->next;
	while(pList)
	{
	 	Node* pNext = pList->next;			
		delete pList;
		pList = pNext;
	}
}

void ReverseList(Node *pHead)
{
	Node* pList = pHead->next;
	Node* pPre = NULL;
	Node* pNext = NULL;
	while(pList)
	{
	    pNext = pList->next;
		pList->next = pPre;
		pPre = pList;
		pList = pNext;	
	}
	pHead->next = pPre;
}

int main(int argc, char** argv) {
	
	Node head;
	InitList(&head);
	PrintList(&head);
	ReverseList(&head);
	PrintList(&head);
	ReleaseList(&head);
	return 0;
}