单向链表节点的逆序反转

#include <stdio.h>

typedef struct node{
	int val;
	struct node *next;
}node;

void reverse(node * pHead)
{
	node * pCur, * pNewHead, * pTemp;
	
	if(NULL == pHead || NULL == pHead->next)
		return;
	
	pNewHead = pHead;
	pCur = pHead->next;
	while(pCur != NULL)
	{
		pTemp = pCur->next;
		pCur->next = pNewHead;
		pHead->next = pTemp;
		pNewHead = pCur;
		pCur = pTemp;
	}
}
int main(void)
{
	char i = 0;
	node buffNode[10] =  {0};
	for(i = 0; i < 9; i++)
	{
		buffNode[i].val = i;
		buffNode[i].next = &buffNode[i+1];
	}
	buffNode[9].val = 9;
	reverse(buffNode);
	//....................验证
	for(i = 0; i < 10; i++)
	{
		printf("%d",buffNode[i].val);
		if(buffNode[i].next != NULL)
		{
			printf(" -> ");
			printf("%d\n",buffNode[i].next->val);
		}
		else
		{
			printf(" -> NULL\n");
		}
	}

	return 0;
}