问：编写程序创建N个节点的双向链表并逆序显示。

2025年03月17日 | 阅读 9 分钟

说明

在此程序中，我们创建一个双向链表，然后通过反转列表方向来反转链表，并打印出节点。

Program to create a doubly linked list of n nodes and display it in reverse order

通过交换每个节点的 previous 指针和 next 指针来遍历链表。然后，交换 head 和 tail 节点的位置，即原始列表的 head 将成为新列表的 tail，原始列表的 tail 将成为新列表的 head。因此，反转后的列表将是

算法

定义一个 Node 类，它表示列表中的一个节点。它将有三个属性：数据、previous 指向前一个节点，以及 next 指向下一个节点。
定义另一个用于创建双向链表的类，它有两个节点：头节点和尾节点。最初，头节点和尾节点将指向 null。
addNode() 将向列表中添加节点。
1. 它首先检查头节点是否为 null，然后将节点作为头节点插入。
2. 头节点和尾节点都将指向新添加的节点。
3. 头节点的前一个指针将指向 null，尾节点的下一个指针将指向 null。
4. 如果头节点不为 null，则新节点将插入到列表的末尾，使得新节点的前一个指针将指向尾节点。
5. 新节点将成为新的尾节点。尾节点的下一个指针将指向 null。
reverse() 函数将反转给定的双向链表。
1. 定义一个 current 节点，它最初将指向 head。
2. 通过在每次迭代中使 current 指向 current.next 来遍历链表，直到 current 指向 null。
3. 在每次迭代中，交换每个节点的 previous 和 next 指针，以反转列表的方向。
4. 最后，交换 head 和 tail 的位置。
display() 将显示列表中存在的所有节点。
1. 定义一个新节点“current”，它将指向头节点。
2. 打印 current.data 直到 current 指向 null。
3. 在每次迭代中，current 将指向列表中的下一个节点。

解决方案

Python

#Represent a node of doubly linked list
class Node:
    def __init__(self,data):
        self.data = data;
        self.previous = None;
        self.next = None;
        
class ReverseList:
    #Represent the head and tail of the doubly linked list
    def __init__(self):
        self.head = None;
        self.tail = None;
        
    #addNode() will add a node to the list
    def addNode(self, data):
        #Create a new node
        newNode = Node(data);
        
        #If list is empty
        if(self.head == None):
            #Both head and tail will point to newNode
            self.head = self.tail = newNode;
            #head's previous will point to None
            self.head.previous = None;
            #tail's next will point to None, as it is the last node of the list
            self.tail.next = None;
        else:
            #newNode will be added after tail such that tail's next will point to newNode
            self.tail.next = newNode;
            #newNode's previous will point to tail
            newNode.previous = self.tail;
            #newNode will become new tail
            self.tail = newNode;
            #As it is last node, tail's next will point to None
            self.tail.next = None;
            
    #reverse() will reverse the doubly linked list
    def reverse(self):
        #Node current will point to head
        current = self.head;
        
        #Swap the previous and next pointers of each node to reverse the direction of the list
        while(current != None):
            temp = current.next;
            current.next = current.previous;
            current.previous = temp;
            current = current.previous;
        #Swap the head and tail pointers.
        temp = self.head;
        self.head = self.tail;
        self.tail = temp;
        
    #display() will print out the elements of the list
    def display(self):
        #Node current will point to head
        current = self.head;
        if(self.head == None):
            print("List is empty");
            return;
            
        while(current != None):
            #Prints each node by incrementing pointer.
            print(current.data),
            current = current.next;
            
dList = ReverseList();
#Add nodes to the list
dList.addNode(1);
dList.addNode(2);
dList.addNode(3);
dList.addNode(4);
dList.addNode(5);
 
print("Original List: ");
dList.display();
 
#Reverse the given list
dList.reverse();
 
#Displays the reversed list
print("\nReversed List: ");
dList.display();

输出

Original List: 
1 2 3 4 5 
Reversed List: 
5 4 3 2 1

C

#include <stdio.h>
 
//Represent a node of the doubly linked list

struct node{
    int data;
    struct node *previous;
    struct node *next;
};    
 
//Represent the head and tail of the doubly linked list
struct node *head, *tail = NULL;
 
//addNode() will add a node to the list
void addNode(int data) {
    //Create a new node
    struct node *newNode = (struct node*)malloc(sizeof(struct node));
    newNode->data = data;
    
    //If list is empty
    if(head == NULL) {
        //Both head and tail will point to newNode
        head = tail = newNode;
        //head's previous will point to NULL
        head->previous = NULL;
        //tail's next will point to NULL, as it is the last node of the list
        tail->next = NULL;
    }
    else {
        //newNode will be added after tail such that tail's next will point to newNode
        tail->next = newNode;
        //newNode's previous will point to tail
        newNode->previous = tail;
        //newNode will become new tail
        tail = newNode;
        //As it is last node, tail's next will point to NULL
        tail->next = NULL;
    }
}
 
//reverse() will reverse the doubly linked list
void reverse() {
    //Node current will point to head
    struct node *current = head, *temp = NULL;
    
    //Swap the previous and next pointers of each node to reverse the direction of the list
    while(current != NULL) {
        temp = current->next;
        current->next = current->previous;
        current->previous = temp;
        current = current->previous;
    }
    //Swap the head and tail pointers.
    temp = head;
    head = tail;
    tail = temp;
}
 
//display() will print out the nodes of the list
void display() {
    //Node current will point to head
    struct node *current = head;
    if(head == NULL) {
        printf("List is empty\n");
        return;
    }
    while(current != NULL) {
        //Prints each node by incrementing pointer.
        printf("%d ", current->data);
        current = current->next;
    }
}
 
int main()
{
    //Add nodes to the list
    addNode(1);
    addNode(2);
    addNode(3);
    addNode(4);
    addNode(5);
    
    printf("Original List: \n");
    display();
    
    //Reverse the given list
    reverse();
    
    //Displays the reversed list
    printf("\nReversed List: \n");
    display();
 
    return 0;
}

输出

Original List: 
1 2 3 4 5 
Reversed List: 
5 4 3 2 1

JAVA

public class ReverseList {
    
    //Represent a node of the doubly linked list

    class Node{
        int data;
        Node previous;
        Node next;
        
        public Node(int data) {
            this.data = data;
        }
    }
    
    //Represent the head and tail of the doubly linked list
    Node head, tail = null;
    
    //addNode() will add a node to the list
    public void addNode(int data) {
        //Create a new node
        Node newNode = new Node(data);
        
        //If list is empty
        if(head == null) {
            //Both head and tail will point to newNode
            head = tail = newNode;
            //head's previous will point to null
            head.previous = null;
            //tail's next will point to null, as it is the last node of the list
            tail.next = null;
        }
        else {
            //newNode will be added after tail such that tail's next will point to newNode
            tail.next = newNode;
            //newNode's previous will point to tail
            newNode.previous = tail;
            //newNode will become new tail
            tail = newNode;
            //As it is last node, tail's next will point to null
            tail.next = null;
        }
    }
    
    //reverse() will reverse the doubly linked list
    public void reverse() {
        //Node current will point to head
        Node current = head, temp = null;
        
        //Swap the previous and next pointers of each node to reverse the direction of the list
        while(current != null) {
            temp = current.next;
            current.next = current.previous;
            current.previous = temp;
            current = current.previous;
        }
        //Swap the head and tail pointers.
        temp = head;
        head = tail;
        tail = temp;
    }
    
    //display() will print out the elements of the list
    public void display() {
        //Node current will point to head
        Node current = head;
        if(head == null) {
            System.out.println("List is empty");
            return;
        }
        
        while(current != null) {
            //Prints each node by incrementing the pointer.

            System.out.print(current.data + " ");
            current = current.next;
        }
    }
    
    public static void main(String[] args) {
        
        ReverseList dList = new ReverseList();
        //Add nodes to the list
        dList.addNode(1);
        dList.addNode(2);
        dList.addNode(3);
        dList.addNode(4);
        dList.addNode(5);
        
        System.out.println("Original List: ");
        dList.display();
        
        //Reverse the given list
        dList.reverse();
        
        //Displays the reversed list
        System.out.println("\nReversed List: ");
        dList.display();
    }
}

输出

Original List: 
1 2 3 4 5 
Reversed List: 
5 4 3 2 1

C#

using System; 
namespace DoublyLinkedList 
{                     
    public class Program
    {
        //Represent a node of the doubly linked list

        public class Node<T>{
            public T data;
            public Node<T> previous;
            public Node<T> next;
            
            public Node(T value) {
                data = value;
            }
        }
        
        public class ReverseList<T>{
            //Represent the head and tail of the doubly linked list
            protected Node<T> head = null;             
             protected Node<T> tail = null;
            
            //addNode() will add a node to the list
            public void addNode(T data) {
                //Create a new node
                Node<T> newNode = new Node<T>(data);
 
                //If list is empty
                if(head == null) {
                    //Both head and tail will point to newNode
                    head = tail = newNode;
                    //head's previous will point to null
                    head.previous = null;
                    //tail's next will point to null, as it is the last node of the list
                    tail.next = null;
                }
                else {
                    //newNode will be added after tail such that tail's next will point to newNode
                    tail.next = newNode;
                    //newNode's previous will point to tail
                    newNode.previous = tail;
                    //newNode will become new tail
                    tail = newNode;
                    //As it is last node, tail's next will point to null
                    tail.next = null;
                }
            }
            
            //reverse() will reverse the doubly linked list
            public void reverse() {
                //Node current will point to head
                Node<T> current = head, temp = null;
 
                //Swap the previous and next pointers of each node to reverse the direction of the list
                while(current != null) {
                    temp = current.next;
                    current.next = current.previous;
                    current.previous = temp;
                    current = current.previous;
                }
                //Swap the head and tail pointers.
                temp = head;
                head = tail;
                tail = temp;
            }
            
            //display() will print out the nodes of the list
            public void display() {
                //Node current will point to head
                Node<T> current = head;
                if(head == null) {
                    Console.WriteLine("List is empty");
                    return;
                }
                while(current != null) {
                    //Prints each node by incrementing the pointer.

                    Console.Write(current.data + " ");
                    current = current.next;
                }
            }
        }
        
        public static void Main()
        {
            ReverseList<int> dList = new ReverseList<int>();
            //Add nodes to the list
            dList.addNode(1);
            dList.addNode(2);
            dList.addNode(3);
            dList.addNode(4);
            dList.addNode(5);
 
            Console.WriteLine("Original List: ");
            dList.display();
 
            //Reverse the given list
            dList.reverse();
 
            //Displays the reversed list
            Console.WriteLine("\nReversed List: ");
            dList.display();
        }    
    }
}

输出

Original List: 
1 2 3 4 5 
Reversed List: 
5 4 3 2 1

PHP

<!DOCTYPE html>
<html>
<body>
<?php
//Represent a node of doubly linked list
class Node{
    public $data;
    public $previous;
    public $next;
    
    function __construct($data){
        $this->data = $data;
    }
}
class ReverseList{
    //Represent the head and tail of the doubly linked list
    public $head;
    public $tail;
    function __construct(){
        $this->head = NULL;
        $this->tail = NULL;
    }
    
    //addNode() will add a node to the list
    function addNode($data){
        //Create a new node
        $newNode = new Node($data);
        
        //If list is empty
        if($this->head == NULL) {
            //Both head and tail will point to newNode
            $this->head = $this->tail = $newNode;
            //head's previous will point to NULL
            $this->head->previous = NULL;
            //tail's next will point to NULL, as it is the last node of the list
            $this->tail->next = NULL;
        }
        else {
            //newNode will be added after tail such that tail's next will point to newNode
            $this->tail->next = $newNode;
            //newNode's previous will point to tail
            $newNode->previous = $this->tail;
            //newNode will become new tail
            $this->tail = $newNode;
            //As it is last node, tail's next will point to NULL
            $this->tail->next = NULL;
        }
    }
    
    //reverse() will reverse the doubly linked list
    function reverse() {
        //Node current will point to head
        $current = $this->head;
        
        //Swap the previous and next pointers of each node to reverse the direction of the list
        while($current != NULL) {
            $temp = $current->next;
            $current->next = $current->previous;
            $current->previous = $temp;
            $current = $current->previous;
        }
        //Swap the head and tail pointers.
        $temp = $this->head;
        $this->head = $this->tail;
        $this->tail = $temp;
    }
    
    //display() will print out the nodes of the list
    function display() {
        //Node current will point to head
        $current = $this->head;
        if($this->head == NULL) {
            print("List is empty <br>");
            return;
        }
        while($current != NULL) {
            //Prints each node by incrementing pointer.
            print($current->data . " ");
            $current = $current->next;
        }
    }
}
    
$dList = new ReverseList();
//Add nodes to the list
$dList->addNode(1);
$dList->addNode(2);
$dList->addNode(3);
$dList->addNode(4);
$dList->addNode(5);
 
print("Original List: <br>");
$dList->display();
 
//Reverse the given list
$dList->reverse();
 
//Displays the reversed list
print("<br>Reversed List: <br>");
$dList->display();
?>
</body>
</html>

输出

Original List: 
1 2 3 4 5 
Reversed List: 
5 4 3 2 1

下一主题#

问：编写程序创建N个节点的双向链表并逆序显示。

说明

算法

解决方案

Python

C

JAVA

C#

PHP

联系信息

关注我们

教程

面试题

在线编译器

Python

Java

.Net Framework

AI, ML and Data Science

Cloud Technology

B.Tech and MCA

Web Technology

PHP

Software Testing

Technical Interview

Java Interview

Python

Web Interview

Database Interview

B.Tech / MCA

Important Interview

Software Testing Interview

Company Interviews

Online Compilers

Multiple Choice Questions

程序

问：编写程序创建N个节点的双向链表并逆序显示。

说明

算法

解决方案

Python

C

JAVA

C#

PHP

相关帖子

将一个数组的所有元素复制到另一个数组的程序

将英寸转换为米的程序

打印星型图案 14 的程序

计算球体表面积的程序

打印数字图案 5 的程序

计算字符串中单词总数的程序

打印前 10 个素数的程序

打印图案 7 的程序

查找字符串反转的程序

数组元素左移的程序

订阅 Tpoint Tech

联系信息

关注我们

教程

面试题

在线编译器