结构之法------从无头单链表中删除节点（扩展问题）

node * reverseLinklist(node * L)
{
assert(L != NULL);
node * H = L;		//H为链表头节点
node * prior = NULL;
node * pCurrent = NULL;
node * pNext = NULL;
prior = H;
pCurrent = pNext = prior->next;
prior->next = NULL;	//头节点指向置空，相当于将其先变为“尾节点”
while(pNext)
{
pNext = pCurrent->next;      //pNext指针移动一个位置

//如果pNext指针为空，则表明已经到达链表尾部，此时将H指向pCurrent节点，意味着原来的链表的“尾节点”变为现在的“头节点”
if(pNext == NULL)
{
H = pCurrent;
}
pCurrent->next = prior;
prior = pCurrent;
pCurrent = pNext;
}

return H;
}