//链表(有头节点,c语言)
typedef int ElementType;
struct ListNode;
typedef struct ListNode ListNode;
typedef struct ListNode* ListNodePtr;
typedef ListNodePtr List;
typedef ListNodePtr Position;
struct ListNode
{
ElementType elem;
ListNodePtr next;
};
/** @brief 反转链表(有头节点,c语言)
* @param L 链表L
*/
void ReverseList(List L)
{
if(L==NULL || L->next==NULL || L->next->next==NULL)
return;
Position head=L;
Position prevpos=NULL;
Position curpos=head->next;
Position nextpos=curpos->next;
while(nextpos!=NULL){
curpos->next=prevpos;
prevpos=curpos;
curpos=nextpos;
nextpos=nextpos->next;
}
curpos->next=prevpos;
L->next=curpos; //设置头结点的下一个节点
}