BJFU 231链表的逆转【注意逆转后头结点he尾结点的处理】

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include<queue>
using namespace std;


//结点
typedef struct Lnode {
	int data;
	struct Lnode *next;
}Lnode, *Linklist;

//尾插
void Creatlist(Linklist &L, int &e) {
	Lnode *p = new Lnode;
	p->data = e;
	p->next = NULL;  //处理新加入节点

	Lnode *cur = L;
	while (cur->next != NULL) {
		cur = cur->next;
	}
	cur->next = p;
	p->next = NULL;

}

//初始化
void Initlist(Linklist &L) {
	L = new Lnode;
	L->next = NULL;
}

//链表逆转【逆转后，L1指向第一个元素|而不是L1->next】
void Reverse(Linklist &L1) {
	Lnode *cur = L1;
	Lnode *p = L1->next;
	while (p)
	{
		Lnode *node = p->next;
		p->next = cur;
		cur = p;
		p = node;
	}
	  L1->next = NULL; //**莫丢
	  L1 = cur;  //**莫丢
	   
}

//打印
void Print(Linklist &L1) {
	Lnode *cur = L1;
	while (cur->next->next) {
		printf("%d ", cur->data);
		cur = cur->next;
	}
	cout << cur->data << endl;
}


int main() {
	int n;
	while (scanf("%d",&n)!=EOF) {
		if (n == 0) break;
	    Linklist L1;  
		Initlist(L1);

		for (int i = 0; i < n; i++) { //输入数据
			int e;
			cin >> e;
			Creatlist(L1, e);
		}
		Reverse(L1);//反转链表
		Print(L1);//打印		
	}
}