链表逆置小记

1 图解步骤

2 代码

#include <bits/stdc++.h>
using namespace std;

struct LinkNode {
	int value;
	LinkNode *next;
	LinkNode(int val, LinkNode *nt): value(val), next(nt) {	}
	LinkNode() {	}
};
LinkNode *head, *nxt;
int n;

int main() {
	head = new LinkNode(0, NULL);
	nxt = head;
	cin >> n;
	while (n--) {
		int x;
		cin >> x;
		LinkNode *t = new LinkNode(x, NULL);
		nxt->next = t;
		nxt = t;
	}
	LinkNode *p = head->next, *q;
	if (p == NULL)
		return 0;
	q = p->next;
	p->next = NULL; //逆置的第一个节点next要设置为空
	head->next = p;
	while (q) {
		p = q->next; //存储当前节点的下一节点
		q->next = head->next; //当前节点的下一节点指向表头节点的下一节点
		head->next = q; //表头节点的下一节点指向当前节点
		q = p; //下一个节点重复上述操作实现逆置
	}
	p = head->next;
	while (p) {
		cout << p->value << " ";
		p = p->next;
	}
	return 0;
}