链表反转

即输入链表1->2->3->4->5，反转后为5->4->3->2->1。

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

typedef struct _linka { 
	int data; 
	_linka* next; 
}linka;

// Reverse link
void Reverse(linka*& head) { 
	if(head ==NULL) 
	{
		return; 
	}

	linka *pre, *cur, *ne; 
	pre=head; 
	cur=head->next; 
	while(cur) 
	{ 
	   ne = cur->next; 
	   cur->next = pre; 
	   pre = cur; 
	   cur = ne; 
	} 
	head->next = NULL; 
	head = pre; 
}

int n = 0;

// Create link
linka * CreateLink(void)
{
	linka *head = NULL; 
	linka *pre = NULL;
	linka *forward = NULL;

	pre = forward = (linka *)malloc(sizeof(linka));
	scanf("%d", &forward->data);

	while(forward->data)
	{
		n++;
		if( 1 == n )
		{
			// head node
			head = pre;

		}
		else
		{
			pre->next = forward;
			pre = forward;
			forward = (linka *)malloc(sizeof(linka));
			scanf("%d", &forward->data);
		}
	}

	// Set last node to NULL
	pre->next = NULL;

	return head;
}

// Output link
void OutputLink(linka *head)
{
	if( !head )
	{
		return;
	}

	// output first data
	printf("%d ", head->data);

	// output next data
	while( head->next )
	{
		head = head->next;
		printf("%d ", head->data);
	}

	printf("/n");
}

int _tmain(int argc, _TCHAR* argv[])
{

	linka * head = CreateLink();
	
	printf("Before reverse:/n");
	
	OutputLink(head);

	Reverse(head);

	printf("After reverse:/n");

	OutputLink(head);

	getchar();

	return 0;
}