问：创建和显示循环链表的程序。

17 Mar 2025 | 6 分钟阅读

说明

在此程序中，我们将创建一个循环链表并打印列表中存在的所有节点。

循环链表

循环链表是一种链表。首先，节点是列表中的一个元素，它有两个部分：数据和下一个。数据表示节点中存储的数据，下一个是指向下一个节点的指针。Head 指向列表的第一个元素，Tail 指向列表的最后一个元素。在简单的链表中，所有节点都指向它们的下一个元素，而 Tail 指向 null。

循环链表是节点的集合，其中尾节点也指向头节点。下图描绘了一个循环链表。节点 A 代表头，节点 D 代表尾。因此，在这个列表中，A 指向 B，B 指向 C，C 指向 D，但使其循环的是节点 D 指向节点 A。

Program to create and display a circular linked list

算法

定义一个 Node 类，它表示列表中的一个节点。它有两个属性 data 和 next，next 将指向下一个节点。
定义另一个类来创建循环链表，它有两个节点：head 和 tail。它有两个方法：add() 和 display()。
add() 将节点添加到列表中
1. 它首先检查头节点是否为 null，然后将节点作为头节点插入。
2. head 和 tail 都将指向新添加的节点。
3. 如果 head 不为 null，新节点将成为新的尾节点，并且新尾节点将指向 head，因为它是一个循环链表。
display() 将显示列表中存在的所有节点。
1. 定义一个新节点“current”，它将指向头节点。
2. 打印 current.data 直到 current 指向 head
3. 在每次迭代中，current 将指向列表中的下一个节点。

解决方案

Python

#Represents the node of list.
class Node:
  def __init__(self,data):
    self.data = data;
    self.next = None;
 
class CreateList:
  #Declaring head and tail pointer as null.
  def __init__(self):
    self.head = Node(None);
    self.tail = Node(None);
    self.head.next = self.tail;
    self.tail.next = self.head;
    
  #This function will add the new node at the end of the list.
  def add(self,data):
    newNode = Node(data);
    #Checks if the list is empty.
    if self.head.data is None:
      #If list is empty, both head and tail would point to new node.
      self.head = newNode;
      self.tail = newNode;
      newNode.next = self.head;
    else:
      #tail will point to new node.
      self.tail.next = newNode;
      #New node will become new tail.
      self.tail = newNode;
      #Since, it is circular linked list tail will point to head.
      self.tail.next = self.head;
 
  #Displays all the nodes in the list
  def display(self):
    current = self.head;
    if self.head is None:
      print("List is empty");
      return;
    else:
        print("Nodes of the circular linked list: ");
        #Prints each node by incrementing pointer.
        print(current.data),
        while(current.next != self.head):
            current = current.next;
            print(current.data),
 
 
class CircularLinkedList:
  cl = CreateList();
  #Adds data to the list
  cl.add(1);
  cl.add(2);
  cl.add(3);
  cl.add(4);
  #Displays all the nodes present in the list
  cl.display();

输出

Nodes of the circular linked list: 
1 2 3 4

C

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
 
//Represents the node of list.
struct node{
    int data;
    struct node *next;
};
 
//Declaring head and tail pointer as null.
struct node *head = NULL;
struct node *tail = NULL;
 
//This function will add the new node at the end of the list.
void add(int data){
    //Create new node
    struct node *newNode = (struct node*)malloc(sizeof(struct node));
    newNode->data = data;
    //Checks if the list is empty.
    if(head == NULL){
        //If list is empty, both head and tail would point to new node.
        head = newNode;
        tail = newNode;
        newNode->next = head;
    }else {
        //tail will point to new node.
        tail->next = newNode;
        //New node will become new tail.
        tail = newNode;
        //Since, it is circular linked list tail will point to head.
        tail->next = head;
    }
}
 
//This function will display the nodes of circular linked list
void display(){
    struct node *current = head;
    if(head == NULL){
        printf("List is empty");
    }
    else{
        printf("Nodes of the circular linked list: \n");
         do{
             //Prints each node by incrementing pointer.
            printf("%d ", current->data);
            current = current->next;
        }while(current != head);
        printf("\n");
    }
}
    
int main()
{
    //Adds data to the list
   add(1);
   add(2);
   add(3);
   add(4);
   //Displays all the nodes present in the list
   display();
   
   return 0;
}

输出

Nodes of the circular linked list: 
1 2 3 4

JAVA

public class CreateList {
    //Represents the node of list.
    public class Node{
        int data;
        Node next;
        public Node(int data) {
            this.data = data;
        }
    }
    
    //Declaring head and tail pointer as null.
    public Node head = null;
    public Node tail = null;
    
    //This function will add the new node at the end of the list.
    public void add(int data){
        //Create new node
        Node newNode = new Node(data);
        //Checks if the list is empty.
        if(head == null) {
             //If list is empty, both head and tail would point to new node.
            head = newNode;
            tail = newNode;
            newNode.next = head;
        }
        else {
            //tail will point to new node.
            tail.next = newNode;
            //New node will become new tail.
            tail = newNode;
            //Since, it is circular linked list tail will point to head.
            tail.next = head;
        }
    }
    
    //Displays all the nodes in the list
    public void display() {
        Node current = head;
        if(head == null) {
            System.out.println("List is empty");
        }
        else {
            System.out.println("Nodes of the circular linked list: ");
             do{
                //Prints each node by incrementing pointer.
                System.out.print(" "+ current.data);
                current = current.next;
            }while(current != head);
            System.out.println();
        }
    }
    
    public static void main(String[] args) {
        CreateList cl = new CreateList();
        //Adds data to the list
        cl.add(1);
        cl.add(2);
        cl.add(3);
        cl.add(4);
        //Displays all the nodes present in the list
        cl.display();
    }
}

输出

Nodes of the circular linked list: 
1 2 3 4

C#

 using System; 
namespace CircularLinkedList 
{                     
    public class Program
    {
        //Represents the node of list.
        public class Node<T>{
            public T data;
            public Node<T> next;
            public Node(T value) {
                data = value;
                next = null;
            }
        }
        
        public class CreateList<T>{
            protected Node<T> head = null;             
             protected Node<T> tail = null;
            
            //This function will add the new node at the end of the list.
            public void add(T data){
                //Create new node
                Node<T> newNode = new Node<T>(data);
                //Checks if the list is empty.
                if(head == null){
                    head = newNode;
                    tail = newNode;
     newNode.next = head;
                }else{
                    //tail will point to new node.
                    tail.next = newNode;
                    //New node will become new tail.
                    tail = newNode;
                    //Since, it is circular linked list tail will point to head.
                    tail.next = head;
                }
            }
            
            //Displays all the nodes in the list
            public void display(){
                Node<T> current;
                if(head == null){
                    Console.WriteLine("List is empty");
                }
                else{
                    //Prints each node by incrementing pointer.
                    Console.WriteLine("Nodes of the circular linked list: ");
                    Console.Write(" "+head.data);
                    for(current = head.next; current!= head; current= current.next){
                        Console.Write(" "+current.data);
                    }
                }    
            }
        }
        
        public static void Main()
        {
            
        CreateList<int> cl = new CreateList<int>();
        //Adds data to the list
        cl.add(1);
        cl.add(2);
        cl.add(3);
        cl.add(4);
        //Displays all the nodes present in the list
        cl.display();
        }    
    }
}

输出

Nodes of the circular linked list: 
1 2 3 4

PHP

<!DOCTYPE html>
<html>
<body>
<?php
//Represents the node of list.
class Node{
    public $data;
    public $next;
    function __construct($data){
        $this->data = $data;
        $this->next = NULL;
    }
}
class CreateList{
    //Declaring head and tail pointer as null.
    private $head;
    private $tail;
    function __construct(){
        $this->head = NULL;
        $this->tail = NULL;
    }
    //This function will add the new node at the end of the list.
    function add($data){
        //Create new node
        $newNode = new Node($data);
        //Checks if the list is empty.
        if($this->head == NULL){
            //If list is empty, both head and tail would point to new node.
            $this->head = $newNode;
            $this->tail = $newNode;
            $newNode->next = $this->head;
        }
        else{
            //tail will point to new node.
            $this->tail->next = $newNode;
            //New node will become new tail.
            $this->tail = $newNode;
            //Since, it is circular linked list tail will point to head.
            $this->tail->next = $this->head;
        }
    }
    //Displays all the nodes in the list
    function display() {
        $current = $this->head;
        if($this->head == NULL) {
            echo "List is empty";
        }
        else {
            echo "Nodes of the circular linked list: <br>";
             do{
                //Prints each node by incrementing pointer.
                echo(" $current->data");
                $current = $current->next;
            }while($current != $this->head);
            echo "<br>";
        }
    }   
}
$cl = new CreateList();
//Adds data to the list
$cl->add(1);
$cl->add(2);
$cl->add(3);
$cl->add(4);
//Displays all the nodes present in the list
$cl->display();
?>
</body>
</html>

输出

Nodes of the circular linked list: 
1 2 3 4

下一主题#

问：创建和显示循环链表的程序。

说明

循环链表

算法

解决方案

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

程序

问：创建和显示循环链表的程序。

说明

循环链表

算法

解决方案

Python

C

JAVA

C#

PHP

相关帖子

编写计算偶数和的程序

编写计算等腰三角形面积的程序

打印 1 到 100 之间的所有快乐数的程序

打印数组中最大元素的程序

程序列表 | 编程示例

在双向链表末尾插入新节点的程序

编写计算菱形面积的程序

打印图案 2 的程序

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

确定两个矩阵是否相等的程序

订阅 Tpoint Tech

联系信息

关注我们

教程

面试题

在线编译器