单链表逆置

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

Node *reverseLink(Node *head)
{
	if(!head || NULL == head ->next)
	return head;
	Node *pre, *pCurrent, *pTemp;
	pre = head;
	pCurrent = head -> next;
	while(pCurrent)
	{
		pTemp = pCurrent -> next;
		pCurrent -> next = pre;
		pre = pCurrenpt;
		pCurrent = pTemp;
	}
	head -> next = NULL;
	head = pre;
	return head;
}