问：创建包含 n 个节点的循环链表并计算节点数的程序。

2025 年 1 月 8 日 | 阅读时间：6 分钟

说明

在此程序中，我们需要找出循环链表中存在的节点数。我们首先创建循环链表，然后遍历列表并计数器变量 'count' 加 1。

算法

定义一个 Node 类，它表示列表中的一个节点。它有两个属性 data 和 next，next 将指向下一个节点。
定义另一个类来创建循环链表，它有两个节点：head 和 tail。它有两个方法：add() 和 display()。
add() 将节点添加到列表中
1. 它首先检查 size 或 head 是否为空；然后它将插入节点作为 head。
2. 头节点和尾节点都将指向新添加的节点。
3. 如果 head 不为空，新节点将成为新的尾节点，并且由于它是循环链表，新的尾节点将指向 head。
countNodes() 将计算列表中存在的节点数。
1. 定义新的节点 current，它将指向 head 节点。
2. 通过使 current 节点指向列表中的下一个节点，直到 current 再次指向 head，来遍历列表以计算节点数。

解决方案

Python

#Represents the node of the 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.count = 0;
        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;
            
    #This function will count the nodes of circular linked list
    def countNodes(self):
        current = self.head;
        self.count=self.count+1;
        while(current.next != self.head):
            self.count=self.count+1;
            current = current.next;
        print("Count of nodes present in circular linked list: "),
        print(self.count);
    
 
class CircularLinkedList:
    cl = CreateList();
    #Adds data to the list
    cl.add(1);
    cl.add(2);
    cl.add(4);
    cl.add(1);
    cl.add(2);
    cl.add(3);
    #Displays all the nodes present in the list
    cl.countNodes();

输出

Count of nodes present in circular linked list: 6

C

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
 
//Represents the node of list.
struct node{
    int data;
    struct node *next;
};
 
int count = 0;
//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 count the nodes of circular linked list
void countNodes() {
    struct node *current = head;
    do{
        count++;
        current = current->next;
    }while(current != head);
    printf("Count of nodes present in circular linked list: %d",count);
}
    
int main()
{
    //Adds data to the list
    add(1);
    add(2);
    add(4);
    add(1);
    add(2);
    add(3);
   //Counts the number of nodes present in the list
   countNodes();
   
   return 0;
}

输出

Count of nodes present in circular linked list: 6

JAVA

public class CountNodes {
        //Represents the node of list.
        public class Node{
            int data;
            Node next;
            public Node(int data) {
                this.data = data;
            }
        }
        
        public int count;
        //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;
            }
        }
        
        //This function will count the nodes of circular linked list
        public void countNodes() {
            Node current = head;
            do{
                //Increment the count variable by 1 for each node
                count++;
                current = current.next;
            }while(current != head);
            System.out.println("Count of nodes present in circular linked list: "+count);
        }
        
        public static void main(String[] args) {
            CountNodes cl = new CountNodes();
            cl.add(1);
            cl.add(2);
            cl.add(4);
            cl.add(1);
            cl.add(2);
            cl.add(3);
            //Counts the number of nodes present in the list
            cl.countNodes();
        }
}

输出

Count of nodes present in circular linked list: 6

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>{
            int count = 0;
            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;
                }
    
            }
            //This function will count the nodes of circular linked list
            public void countNodes() {
                Node<T> current = head;
                do{
                    //Counts nodes by pointing to next node.
                    count++;
                    current = current.next;
                }while(current != head);
                Console.WriteLine("Count of nodes present in circular linked list: "+count);
            }
    }
        
        public static void Main()
        {
            
        CreateList<int> cl = new CreateList<int>();
        //Adds data to the list
        cl.add(1);
        cl.add(2);
        cl.add(4);
        cl.add(1);
        cl.add(2);
        cl.add(3);
        //Counts the number of nodes present in the list
        cl.countNodes();
        }    
    }
}

输出

Count of nodes present in circular linked list: 6

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;
    private $count;
    function __construct(){
        $this->count = 0;
        $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;
        }
    }
        //This function will count the nodes of circular linked list
        function countNodes() {
            $current = $this->head;
            do{
                //Counts nodes by pointing to next node.
                $this->count++;
                $current = $current->next;
            }while($current != $this->head);
            echo "Count of nodes present in circular linked list: $this->count";
        }
        
}
$cl = new CreateList();
//Adds data to the list
$cl->add(1);
$cl->add(2);
$cl->add(4);
$cl->add(1);
$cl->add(2);
$cl->add(3);
//Counts the number of nodes present in the list
$cl->countNodes();
?>
</body>
</html>

输出

Count of nodes present in circular linked list: 6

下一主题#

问：创建包含 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

相关帖子

打印图案 3 的程序

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

对单链表元素进行排序的程序

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

打印给定字符串中最小和最大可能回文单词的程序

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

从循环链表中查找最大和最小值节点的程序

编写计算等腰三角形高（Altitude）的程序

从字符串中分离出单个字符的程序

查找二叉树中最大元素的程序

订阅 Tpoint Tech

联系信息

关注我们

教程

面试题

在线编译器