单链表反转

反转单链表

/*反转链表*/
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <time.h>

typedef struct tmpdata
{
	int data;
	struct tmpdata *next;
}Node;

int main(void)
{
	Node *head, *rear, *font;
	int i;
	head = (Node *)malloc(sizeof(Node));
	rear = head;
	rear->next = NULL;

	srand((unsigned)time(NULL)); //生成随机种子
	//给链表赋值,链表初始化
	for (i = 0;i < 10; i++)
	{
		font = (Node *)malloc(sizeof(Node));
		font->data = rand() % 30 + 20;
		rear->next = font;
		rear = font;
	}
	rear->next = NULL;

	//打印原始链表查看
	font = head->next;
	while (font != NULL)
	{
		printf("%d\t", font->data);
		font = font->next;
	}



	//单链表的反转,用到4个指针,一个头指针固定,两个指针控制节点的行进,一个指针接收拆下来的节点并组成新的链表
	Node *tmp;

	font = head->next;
	rear = head->next;

	//printf("head = %d\tfont = %d\trear = %d\trear->next = %d", head->data, font->data, rear->data, rear->next->data);
	tmp = NULL;
	while (font != NULL)
	{
		font = font->next;
		rear->next = tmp;
		tmp = rear;
		rear = font;
	}
	head->next = tmp;
	putchar('\n');

	//打印反转之后的链表
	rear = head->next;
	while (rear != NULL)
	{
		printf("%d\t", rear->data);
		rear = rear->next;
	}
	return 1;
}

 

评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值