链表逆转6-8

List Reverse( List L )
{
	if(!L)return NULL;
	List pc = L->Next;
	List pn = pc;
	List pre = L;
	while(pc)
	{
		pn = pc->Next;
		
		pc->Next = pre;
		
		pre = pc;
		pc = pn;	
	}
	
	L->Next = NULL;
	
	if(pc)
	printf("pc->data  = %d",pc->Next->Data);
	
	
	return pre;
	
	
}