以反转链表为例的链表初始化

最新推荐文章于 2024-10-16 10:13:45 发布

slam_SponseBob

最新推荐文章于 2024-10-16 10:13:45 发布

阅读量858

点赞数

文章标签： c++

本文链接：https://blog.csdn.net/weixin_51650301/article/details/124222586

版权

这篇博客介绍了如何使用迭代和递归两种方法来反转一个双向链表。首先展示了迭代法的实现，通过交换节点的前后指针完成反转。接着，详细解释了递归法的思路，通过递归调用来反转链表的剩余部分并调整节点指针。最后，代码示例展示了这两种方法的实际应用，并打印反转后的链表节点值进行验证。

摘要由CSDN通过智能技术生成

#include <iostream>
//迭代法
class Node{
public:
  int value;
  Node* next;
  Node(int data){
    this->value = data;
  }
} ;
Node* reverseNode(Node* head)
{
  Node* pre = head;
  Node* cur = NULL;
  while(pre!=NULL)
  {
    Node* tem = pre->next;
    pre->next = cur;
    cur = pre;
    pre = tem;

  }
  return cur;
}
//递归法
Node* d_reverseNode(Node* head)
{
  if(head==NULL||head->next==NULL)
  {
    return head;
  }
  Node* tem = d_reverseNode(head->next);
  head->next->next = head;
  head->next = NULL;
  return tem;
}
int main()
{
Node* node1 = new Node(1);
Node* node2 = new Node(2);
Node* node3 = new Node(3);
Node* node4 = new Node(4);
Node* node5 = new Node(5);
Node* head = node1;
head->next = node2;
node2->next = node3;
node3->next = node4;
node4->next = node5;
node5->next = NULL;
Node* cur = head;
while(cur!=nullptr){
  std::cout << cur->value << ' ';
  cur = cur->next;
}
Node* t = reverseNode(head);
Node* tem = t;
std::cout  << '\n';
while(t!=nullptr)
{
  std::cout << t->value << ' ';
  t = t->next;
}
std::cout  << '\n';
Node* t_1 = d_reverseNode(tem);
while(t_1!=nullptr)
{
  std::cout << t_1->value << ' ';
  t_1 = t_1->next;
}
}