链表的反转

#include<stdio.h>
#include<malloc.h>

typedef struct POINT {
	int data;
	struct POINT* next;
}POINT;

POINT* insertPoint(int data, POINT* root);
void showLinked(POINT* root);
POINT* changeLinked(POINT* root);

POINT* changeLinked(POINT* root) {
	POINT* newPoint = NULL;
	POINT* nowPoint = root;
	POINT* temp = NULL;

	while(nowPoint != NULL) {
		temp = nowPoint->next;
		nowPoint->next = newPoint;
		newPoint = nowPoint;
		nowPoint = temp;
	}
	return newPoint;
}

void showLinked(POINT* root) {
	if(root == NULL) {
		return;
	}

	while(root->next != NULL) {
		printf("%d ", root->data);
		root = root->next;
	}
	printf("%d\n", root->data);
}

POINT* insertPoint(int data, POINT* root) {
	POINT* oldRoot = root;
	if(root == NULL) {
		root = (POINT *)malloc(sizeof(POINT));
		root->next = NULL;
		root->data = data;
		return root;
	}

	while(root->next != NULL) {
		root = root->next;
	}

	root->next = (POINT *)malloc(sizeof(POINT));
	root->next->next = NULL;
	root->next->data = data;

	return oldRoot;
}

void main(void) {
	POINT* root = NULL;
	root = insertPoint(1,root);
	root = insertPoint(2,root);
	root = insertPoint(3,root);
	root = insertPoint(4,root);
	root = insertPoint(5,root);
	root = insertPoint(1,root);
	root = insertPoint(53,root);
	root = insertPoint(25,root);
	showLinked(root);
	root = changeLinked(root);
	showLinked(root);
}

结果如下：