双向链表的逆置

代码实现

将链表结点逆置（头插法）

typedef struct Node
{
	int data;
	Node* next;
	Node* prior;
}Node,*List;

void Reverse(List ps)
{
	if(NULL == ps || NULL == ps->next)
	{
		return ;
	}
	List p1 = ps->next;
	List p2 = p1->next;
	List p3 = NULL;
	p1->next = NULL;
	while(p2)
	{
		p3 = p2->next;
		p2->next = p1;
		p1->prior = p2;
		p1 = p2;
		p2 = p3;
	}
	head->next = p1;
}