数据结构之链表反转

最新推荐文章于 2024-11-08 23:41:22 发布

捞仔程序猿

最新推荐文章于 2024-11-08 23:41:22 发布

阅读量259

点赞数

文章标签：数据结构链表 c++

本文链接：https://blog.csdn.net/dassel/article/details/126908664

版权

三指针法（就地反转法）

#include <stdio.h>

typedef struct LINK
{
	int data;
	struct LINK*next;
}Link;

void printLink(Link*head)
{
	while( head != NULL)
	{
		printf("%d ->",head->data);
		head = head->next;
	}
	printf("NULL\n");
}

Link* reverseLink(Link *head)
{
	Link *pre = NULL;
	Link *cur = head;
	Link *back;

	while(cur)
	{
		back = cur->next;
		cur->next = pre;
		pre = cur;
		cur = back;
	}
	head->next = NULL;
	return pre;
	
}

int main()
{
	Link node4 = {4,NULL};
	Link node3 = {3,&node4};
	Link node2 = {2,&node3};
	Link node1 = {1,&node2};
	Link *head = NULL;

	printf("Sourse LinkTab:\n");
	printLink(&node1);
	printf("reverse LinkTab:\n");
	head = reverseLink(&node1);
	printLink(head);


	return 0;
}

递归

#include <stdio.h>

typedef struct LINK
{
	int data;
	struct LINK*next;
}Link;

void printLink(Link*head)
{
	while( head != NULL)
	{
		printf("%d ->",head->data);
		head = head->next;
	}
	printf("NULL\n");
}

Link* reverseLink(Link *head)
{
	if(head == NULL || head->next == NULL)
	{
		return head;
	}
	Link* newHead = reverseLink(head->next);
	head->next->next = head;
	head->next = NULL;
	return newHead;
}

int main()
{
	Link node4 = {4,NULL};
	Link node3 = {3,&node4};
	Link node2 = {2,&node3};
	Link node1 = {1,&node2};
	Link *head = NULL;

	printf("Sourse LinkTab:\n");
	printLink(&node1);
	printf("reverse LinkTab:\n");
	head = reverseLink(&node1);
	printLink(head);


	return 0;
}