创建包含 n 个节点的单向链表并以反向顺序显示的程序

2025年3月17日 | 阅读 7 分钟

说明

在此程序中，我们需要创建一个单向链表并逆序显示列表。

原始列表

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

逆序列表

解决此问题的几种方法之一是递归地到达列表末尾并从尾到头显示节点。

算法

创建一个名为 Node 的类，它有两个属性：data 和 next。Next 是指向链表中下一个节点的指针。
创建另一个类，该类具有两个属性：head 和 tail。
addNode() 将向列表添加一个新节点
1. 创建一个新节点。
2. 它首先检查 head 是否等于 null，这意味着列表为空。
3. 如果列表为空，head 和 tail 都将指向新添加的节点。
4. 如果列表不为空，新节点将被添加到列表的末尾，以便 tail 的 next 将指向新添加的节点。这个新节点将成为列表的新 tail。
reverse() 函数将反转列表中节点的顺序。
1. 此方法检查当前节点的下一个节点是否为空，这意味着当前节点指向尾部，然后它将打印尾部节点的数据。
2. 通过考虑当前节点的下一个节点递归调用 reverse()，并从尾部开始以反向顺序打印所有节点。
display() 将显示列表中存在的节点
1. 定义一个节点 current，它最初将指向列表的 head。
2. 遍历列表直到 current 指向 null。
3. 通过使 current 在每次迭代中指向它的下一个节点来显示每个节点。

解决方案

Python

#Represent a node of the singly linked list
class Node:
    def __init__(self,data):
        self.data = data;
        self.next = None;
        
class ReverseList:
    #Represent the head and tail of the singly linked list
    def __init__(self):
        self.head = None;
        self.tail = None;
        
    #addNode() will add a new node to the list
    def addNode(self, data):
        #Create a new node
        newNode = Node(data);
        
        #Checks if the list is empty
        if(self.head == None):
            #If list is empty, both head and tail will point to new node
            self.head = newNode;
            self.tail = newNode;
        else:
            #newNode will be added after tail such that tail's next will point to newNode
            self.tail.next = newNode;
            #newNode will become new tail of the list
            self.tail = newNode;
            
    #reverse() will the reverse the order of the list
    def reverse(self, current):
        #Checks if list is empty
        if(self.head == None):
            print("List is empty");
            return;
        else:
            #Checks if the next node is None, if yes then prints it.
            if(current.next == None):
                print(current.data ,end=" ");
                return;
            #Recursively calls the reverse function
            self.reverse(current.next);
            print(current.data ,end=" ");
    
    #display() will display all the nodes present in 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 , end=" ");
            current = current.next;
        print();
 
sList = ReverseList();
        
#Add nodes to the list
sList.addNode(1);
sList.addNode(2);
sList.addNode(3);
sList.addNode(4);
 
print("Original List: ");
sList.display();
 
print("Reversed List: ");
#Print reversed list
sList.reverse(sList.head);

输出

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

C

#include <stdio.h>
 
//Represent a node of the singly linked list
struct node{
    int data;
    struct node *next;
};    
 
//Represent the head and tail of the singly linked list
struct node *head, *tail = NULL;
 
//addNode() will add a new node to the list
void addNode(int data) {
    //Create a new node
    struct node *newNode = (struct node*)malloc(sizeof(struct node));
    newNode->data = data;
    newNode->next = NULL;
    
    //Checks if the list is empty
    if(head == NULL) {
        //If list is empty, both head and tail will point to new node
        head = newNode;
        tail = newNode;
    }
    else {
        //newNode will be added after tail such that tail's next will point to newNode
        tail->next = newNode;
        //newNode will become new tail of the list
        tail = newNode;
    }
}
 
//reverse() will the reverse the order of the list
void reverse(struct node *current) {
    //Checks if list is empty
    if(head == NULL) {
        printf("List is empty\n");
        return;
    }
    else{
        //Checks if the next node is null, if yes then prints it.
        if(current->next == NULL) {
            printf("%d ", current->data);
            return;
        }
        //Recursively calls the reverse function
        reverse(current->next);
        printf("%d ", current->data);
    }
}
    
//display() will display all the nodes present in 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;
    }
    printf("\n");
}
    
int main()
{
    //Add nodes to the list
    addNode(1);
    addNode(2);
    addNode(3);
    addNode(4);
    
    printf("Original List: \n");
    display();
    
    printf("Reversed List: \n");
    //Print reversed list
    reverse(head);
 
    return 0;
}

输出

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

JAVA

public class ReverseList {
    
    //Represent a node of the singly linked list
    class Node{
        int data;
        Node next;
        
        public Node(int data) {
            this.data = data;
            this.next = null;
        }
    }
 
    //Represent the head and tail of the singly linked list
    public Node head = null;
    public Node tail = null;
    
    //addNode() will add a new node to the list
    public void addNode(int data) {
        //Create a new node
        Node newNode = new Node(data);
        
        //Checks if the list is empty
        if(head == null) {
            //If list is empty, both head and tail will point to new node
            head = newNode;
            tail = newNode;
        }
        else {
            //newNode will be added after tail such that tail's next will point to newNode
            tail.next = newNode;
            //newNode will become new tail of the list
            tail = newNode;
        }
    }
    
    //reverse() will help the reverse the order of the list
    public void reverse(Node current) {
        //Checks if list is empty
        if(head == null) {
            System.out.println("List is empty");
            return;
        }
        else {
            //Checks if the next node is null, if yes then prints it.
            if(current.next == null) {
                System.out.print(current.data + " ");
                return;
            }
            //Recursively calls the reverse function
            reverse(current.next);
            System.out.print(current.data + " ");
        }
    }
        
    //display() will display all the nodes present in 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 pointer
            System.out.print(current.data + " ");
            current = current.next;
        }
        System.out.println();
    }
    
    public static void main(String[] args) {
        
        ReverseList sList = new ReverseList();
        
        //Add nodes to the list
        sList.addNode(1);
        sList.addNode(2);
        sList.addNode(3);
        sList.addNode(4);
        
        System.out.println("Original List: ");
        sList.display();
        
        System.out.println("Reversed List: ");
        //Print reversed list
        sList.reverse(sList.head);
    }
}

输出

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

C#

using System;
                    
public class ReverseList
{
    //Represent a node of the singly linked list
    public class Node<T>{
        public T data;
        public Node<T> next;
        
        public Node(T value) {
            data = value;
            next = null;
        }
    }
        
    public class SinglyLinkedList<T>{
        //Represent the head and tail of the singly linked list
        public Node<T> head = null;             
         public Node<T> tail = null;
    
        //addNode() will add a new node to the list
        public void addNode(T data) {
            //Create a new node
            Node<T> newNode = new Node<T>(data);
 
            //Checks if the list is empty
            if(head == null) {
                //If list is empty, both head and tail will point to new node
                head = newNode;
                tail = newNode;
            }
            else {
                //newNode will be added after tail such that tail's next will point to newNode
                tail.next = newNode;
                //newNode will become new tail of the list
                tail = newNode;
            }
        }
        
        //reverse() will the reverse the order of the list
        public void reverse(Node<T> current) {
            //Checks if list is empty
            if(head == null) {
                Console.WriteLine("List is empty");
                return;
            }
            else{
                //Checks if the next node is null, if yes then prints it.
                if(current.next == null) {
                    Console.Write(current.data + " ");
                    return;
                }
                //Recursively calls the reverse function
                reverse(current.next);
                Console.Write(current.data + " ");
            }
        }
        
        //display() will display all the nodes present in 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 pointer
                Console.Write(current.data + " ");
                current = current.next;
            }
            Console.WriteLine();
        }
    }
    
    public static void Main()
    {
        SinglyLinkedList<int> sList = new SinglyLinkedList<int>();
        
        //Add nodes to the list
        sList.addNode(1);
        sList.addNode(2);
        sList.addNode(3);
        sList.addNode(4);
        
        Console.WriteLine("Original List: ");
        sList.display();    
        
        Console.WriteLine("Reversed List: ");
        //Print reversed list
        sList.reverse(sList.head);
    }
}

输出

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

PHP

<!DOCTYPE html>
<html>
<body>
<?php
//Represent a node of singly linked list
class Node{
    public $data;
    public $next;
    
    function __construct($data){
        $this->data = $data;
        $this->next = NULL;
    }
}
class ReverseList{
    //Represent the head and tail of the singly linked list
    public $head;
    public $tail;
    function __construct(){
        $this->head = NULL;
        $this->tail = NULL;
    }
    
    //addNode() will add a new node to the list
    function addNode($data) {
        //Create a new node
        $newNode = new Node($data);
        
        //Checks if the list is empty
        if($this->head == NULL) {
            //If list is empty, both head and tail will point to new node
            $this->head = $newNode;
            $this->tail = $newNode;
        }
        else {
            //newNode will be added after tail such that tail's next will point to newNode
            $this->tail->next = $newNode;
            //newNode will become new tail of the list
            $this->tail = $newNode;
        }
    }
    
    //reverse() will the reverse the order of the list
    function reverse($current) {
        //Checks if list is empty
        if($this->head == NULL) {
            print("List is empty <br>");
            return;
        }
        else{
            //Checks if the next node is null, if yes then prints it.
            if($current->next == NULL) {
                print($current->data . " ");
                return;
            }
            //Recursively calls the reverse function
            $this->reverse($current->next);
            print($current->data . " ");
        }
    }
    
    //display() will display all the nodes present in 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;
        }
        print("<br>");
    }
}
    
$sList = new ReverseList();
        
//Add nodes to the list
$sList->addNode(1);
$sList->addNode(2);
$sList->addNode(3);
$sList->addNode(4);
 
print("Original List: <br>");
$sList->display();
    
print("Reversed List: <br>");
//Print reversed list
$sList->reverse($sList->head);
?>
</body>
</html>

输出

Original List: 
1 2 3 4 
Reversed List: 
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

相关帖子

确定一个字符串是否为另一个字符串的旋转的程序

计算矩形周长的程序

确定给定数字是否为亏数（Deficient number）的程序

计算长方体表面积的程序

打印图案 3 的程序

将英尺转换为厘米的程序

将米转换为英尺和英寸的程序

将毫米转换为英尺的程序

从三元树创建双向链表的程序

程序列表 | 编程示例

订阅 Tpoint Tech

联系信息

关注我们

教程

面试题

在线编译器