template<typename T>
void disorderList<T>::reverse()
{
ListNode<T> *node = first->link;
//这里也许用2个指针就可以,但我没想到解决办法
ListNode<T> *preNode = NULL;
ListNode<T> *currentNode = NULL;
ListNode<T> *newNode = NULL;
while(node!=NULL){
newNode = node;
currentNode = node;
node = node->link;
first->link = newNode;
if(preNode==NULL){
last = newNode;//尾指针
}
newNode->link = preNode;
preNode = currentNode;
}
}
链表反转
最新推荐文章于 2023-12-03 18:23:51 发布