单链表的反转

#include<iostream>
using namespace std;

typedef struct node {

	int data;
	struct node* next;
}list, *linklist;
//链表的初始化
linklist init() {
	linklist l = (struct node*)malloc(sizeof(struct node));
	l->next = NULL;
	return l;
}
//建立链表
void creat(linklist& l) {
	int i;
	linklist p = l;
	for (i = 0; i < 10; i++) {
		linklist newnode = (struct node*)malloc(sizeof(struct node));
		newnode->next = NULL;
		newnode->data = i + 1;
		p->next = newnode;
		p = newnode;
	}
}
//打印链表
void print(linklist &l) {
	linklist p = l;
	p = p->next;
	while (p) {
		cout << p->data << "->";
		p = p->next;
	}
}
//反转
linklist reverse(linklist &l) {
	linklist pre, cur, temp;
	pre = NULL;
	cur = l->next;
	while (cur) { //反转算法 关键是保存当前结点的后继节点
		temp = cur->next;
		cur->next = pre;
		pre = cur;
		cur = temp;
	}
	l->next = pre;
	return l;
}

int main() {
	linklist l = init();
	creat(l);
	cout<<"反转前:";
	print(l);
	cout << endl;
	reverse(l);
	cou<<"反转后:"
	print(l);

	return 0;
}