Reverse Linked List

最新推荐文章于 2021-11-05 23:20:50 发布

dxz935

最新推荐文章于 2021-11-05 23:20:50 发布

阅读量1k

点赞数

分类专栏：数据结构

本文链接：https://blog.youkuaiyun.com/dxz935/article/details/52741304

版权

数据结构专栏收录该内容

11 篇文章

订阅专栏

本文介绍了一种在O(N)时间内使用常数额外空间非递归地反转单链表的方法，并提供了一个C语言实现的例子。该方法通过迭代地重新连接节点指针来完成链表的反转。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Write a nonrecursive procedure to reverse a singly linked list in $O (N)$ time using constant extra space.

Format of functions:

List Reverse( List L );

where List is defined as the following:

typedef struct Node *PtrToNode;
typedef PtrToNode List;
typedef PtrToNode Position;
struct Node {
    ElementType Element;
    Position Next;
};

The function Reverse is supposed to return the reverse linked list ofL, with a dummy header.

Sample program of judge:

#include <stdio.h>
#include <stdlib.h>

typedef int ElementType;
typedef struct Node *PtrToNode;
typedef PtrToNode List;
typedef PtrToNode Position;
struct Node {
    ElementType Element;
    Position Next;
};

List Read(); /* details omitted */
void Print( List L ); /* details omitted */
List Reverse( List L );

int main()
{
    List L1, L2;
    L1 = Read();
    L2 = Reverse(L1);
    Print(L1);
    Print(L2);
    return 0;
}

/* Your function will be put here */

Sample Input:

5
1 3 4 5 2

Sample Output:

2 5 4 3 1
2 5 4 3 1

result:

List Reverse( List L )
{
 Position p1,p2,p3,head,temp;
 if(L==NULL||L->Next==NULL)
  return L;
 p1=L;
 p2=p1->Next;
 p3=p2;
 temp=L->Next;
 while(p3->Next!=NULL)
 {
  p3=p2->Next;
  p2->Next=p1;
p1=p2;
p2=p3;
 }
 p2->Next=p1;
 temp->Next=NULL;
 L->Next=p2;
 return L;
}