数据结构_数据结构_链表面试题----逆置链表 -

逆置链表

这是主要代码部分

// 逆置链表 
#if 0
SListNode * ReverseList(SListNode *pFirst)
{
	//assert(pFirst!= NULL);
	SListNode *pNewFirst=NULL;//创建新结点
	DataType data;
	while (pFirst != NULL)
	{
		data = pFirst->data;
		PopFront(&pFirst);//头删
		PushFront(&pNewFirst, data);//头插
	}
	return pNewFirst;
}
#endif
SListNode * ReverseList2(SListNode *pFirst)
{
	if (pFirst == NULL) {
		return NULL;
	}
	SListNode *p1 = NULL;
	SListNode *p2 = pFirst;//1的地址
	SListNode *p3 = pFirst->pNext;//2的地址
	while (p2)
	{
		p2->pNext = p1;
		p1 = p2;//1->null
		p2 = p3;//2->1->null
		if (p3 != NULL)
		{
			p3 = p3->pNext;//获得3的地址
		}
	}
	return p1;
}

// 头删
void PopFront(SListNode **ppFirst)
{
	assert(ppFirst != NULL);
	assert(*ppFirst != NULL);

	SListNode *pOldFirst = *ppFirst;
	*ppFirst = (*ppFirst)->pNext;
	free(pOldFirst);
}


//头插
void PushFront(SListNode **ppFirst, DataType data)
{
	assert(ppFirst != NULL);
	SListNode *pNewNode = CreateNewNode(data);
	pNewNode->pNext = *ppFirst;
	*ppFirst = pNewNode;
}