单链表反转四种方式实现的是，单链表如何反转

题目：

3->4->5

4->3->2->1

next = node; wydlqcurNode = node; wydlqnextNode = curNode->next; while (nextNode != nullptr) { curNode->next = nextNode->next; nextNode->next = hea活动：慈云数据爆款香港服务器，CTG+CN2高速带宽、快速稳定、平均延迟10+ms 速度快，免备案，每月仅需19元！！ 点击查看d->next; head->next = nextNode; nextNode = curNode->next; } return head->next;}//头插法wydlq reverse2(wydlqnode){ wydlqpreNode = new ListNode(-1); wydlqpCur = node; while (pCur != nullptr) { wydlqpNext = pCur->next; pCur->next = preNode->next; preNode->next = pCur; pCur = pNext; } return preNode->next;}//迭代wydlq reverse3(wydlqnode){ wydlqprev = nullptr; while(node != nullptr){ wydlqtmpNode = node->next; node->next = prev; prev = node; node = tmpNode; } return prev;}//递归wydlq reverse4(wydlqnode){ if(node == nullptr|| node->next == nullptr) { return node; } wydlqprev = reverse4(node->next); node->next->next = node; node->next = nullptr; return prev;}//创建初始化链表wydlq createListNode(){ wydlqhead = nullptr; wydlqnode1 = new ListNode(1); wydlqnode2 = new ListNode(2); wydlqnode3 = new ListNode(3); wydlqnode4 = new ListNode(4); wydlqnode5 = new ListNode(5); head = node1; node1->next = node2; node2->next = node3; node3->next = node4; node4->next = node5; node5->next = nullptr; wydlqnewHead = reverse(head); while (newHead != nullptr) { qDebug() val; newHead = newHead->next; }}

62779911