如何将一个顺序单链表实现逆序

简略方法

https://blog.csdn.net/sjp11/article/details/116076607?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522162599594616780255281154%2522%252C%2522scm%2522%253A%252220140713.130102334..%2522%257D&request_id=162599594616780255281154&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~baidu_landing_v2~default-5-116076607.first_rank_v2_pc_rank_v29&utm_term=%E5%8D%95%E9%93%BE%E8%A1%A8%E7%9A%84%E7%BF%BB%E8%BD%AC

注意这里的pre指向的是头结点不是头指针

Node *reverse(Node *head) {
	Node *former, *current, *later;
	former = head->next;
	current = head->next->next;
	former->next = NULL;//首先将former的next置空，就是翻转后的链表尾
	while (current) {
		later = current->next;//由于会将current和former右移所以每一次循环都要将later重新进行置位
		current->next = former;//将current原本向右指的指针向左指
		former = current;//指针不断右移的过程
		current = later;
	}
	return former;//目前的缺陷是返回的头结点而不是头指针，所以最好用没有头指针的输出方法
}

-------------------------------------------------------------------------------------

经过查阅发现这种方法太繁琐所以不建议用

https://blog.csdn.net/bingocoder/article/details/88761047?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522162599092116780264068281%2522%252C%2522scm%2522%253A%252220140713.130102334.pc%255Fall.%2522%257D&request_id=162599092116780264068281&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~first_rank_v2~rank_v29-3-88761047.first_rank_v2_pc_rank_v29&utm_term=%E5%A6%82%E4%BD%95%E5%B0%86%E4%B8%80%E4%B8%AA%E9%80%86%E5%BA%8F%E9%93%BE%E8%A1%A8%E7%BF%BB%E8%BD%AC&spm=1018.2226.3001.4187

这是别人的文章

现在对其进行自我的整理

链表翻转代码如下

list reverse(list head)
{
	if (head->next == NULL || head->next->next == NULL)
	{
		return head;   /*链表为空或只有一个元素则直接返回*/
	}
 
	list t = NULL;
	list p = head->next;
	list q = head->next->next;
	while (q != NULL)
	{
		t = q->next;
		q->next = p;
		p = q;
		q = t;
	}
 
	/*此时q指向原始链表最后一个元素，也是逆转后的链表的表头元素*/
	head->next->next = NULL;  /*设置链表尾*/
	head->next = p;           /*调整链表头*/
	return head;
}

指针作用的说明

p=head->next;

q=head->next->next;

t=q->next;//此时t指针的作用我认为是用于将p的next首先暂存起来，然后让p,q都实现右移

代码的图文解释

list t = NULL;
	list p = head->next;
	list q = head->next->next;
	while (q != NULL)
	{
		t = q->next;
		q->next = p;
		p = q;
		q = t;
	}

.

/*此时q指向原始链表最后一个元素，也是逆转后的链表的表头元素*/
	head->next->next = NULL;  /*设置链表尾*/
	head->next = p;           /*调整链表头*/
	return head;