创建包含 n 个节点的单向链表并计算节点数量的程序

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

说明

在此程序中，我们需要创建一个单向链表并计算列表中存在的节点数。

Program to create a singly linked list of n nodes and count the number of nodes

要完成此任务，请使用初始指向 head 的节点 current 遍历列表。以 such a way that current will point to its next node in each iteration and increment variable count by 1 的方式递增 current。最后，count 将保存表示列表中节点数的值。

算法

创建一个名为 Node 的类，它有两个属性：data 和 next。Next 是指向链表中下一个节点的指针。
创建另一个类，该类具有两个属性：head 和 tail。
addNode() 将向列表添加一个新节点
1. 创建一个新节点。
2. 它首先检查 head 是否等于 null，这意味着列表为空。
3. 如果列表为空，head 和 tail 都将指向新添加的节点。
4. 如果列表不为空，新节点将添加到列表末尾，使得 tail 的 next 指向新添加的节点。此新节点将成为列表的新 tail。
countNodes() 将计算列表中存在的节点数
1. 定义一个节点 current，它最初将指向列表的 head。
2. 声明并初始化变量 count 为 0。
3. 遍历列表，直到 current 指向 null。
4. 对于列表中遇到的每个节点，将 count 的值加 1。
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 CountNodes:
    #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;
            
    #countNodes() will count the nodes present in the list
    def countNodes(self):
        count = 0;
        #Node current will point to head
        current = self.head;
        
        while(current != None):
            #Increment the count by 1 for each node
            count = count + 1;
            current = current.next;
        return count;
    
    #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;
        print("Nodes of singly linked list: ");
        while(current != None):
            #Prints each node by incrementing pointer
            print(current.data),
            current = current.next;
     
 
sList = CountNodes();
        
#Add nodes to the list
sList.addNode(1);
sList.addNode(2);
sList.addNode(3);
sList.addNode(4);
 
#Displays the nodes present in the list
sList.display();
 
#Counts the nodes present in the given list
print("Count of nodes present in the list: " + str(sList.countNodes()));

输出

 Nodes of singly linked list: 
1 2 3 4 
Count of nodes present in the list: 4

C

#include <stdio.h>
 
//Represent a node of 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;
    }
}
 
//countNodes() will count the nodes present in the list
int countNodes() {
    int count = 0;
    //Node current will point to head
    struct node *current = head;
    
    while(current != NULL) {
        //Increment the count by 1 for each node
        count++;
        current = current->next;
    }
    return count;
}
    
//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;
    }
    printf("Nodes of singly linked list: \n");
    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);
    
    //Displays the nodes present in the list
    display();
    
    //Counts the nodes present in the given list
    printf("Count of nodes present in the list: %d", countNodes());
 
    return 0;
}

输出

Nodes of singly linked list: 
1 2 3 4 
Count of nodes present in the list: 4

JAVA

public class CountNodes {
    
    //Represent a node of 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;
        }
    }
    
    //countNodes() will count the nodes present in the list
    public int countNodes() {
        int count = 0;
        //Node current will point to head
        Node current = head;
        
        while(current != null) {
            //Increment the count by 1 for each node
            count++;
            current = current.next;
        }
        return count;
    }
        
    //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;
        }
        System.out.println("Nodes of singly linked list: ");
        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) {
        
        CountNodes sList = new CountNodes();
        
        //Add nodes to the list
        sList.addNode(1);
        sList.addNode(2);
        sList.addNode(3);
        sList.addNode(4);
        
        //Displays the nodes present in the list
        sList.display();
        
        //Counts the nodes present in the given list
        System.out.println("Count of nodes present in the list: " + sList.countNodes());
    }
}

输出

Nodes of the singly linked list:
1 2 3 4 
Count of nodes present in the list: 4

C#

using System;
                    
public class CountNodes
{
    //Represent a node of 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;
            }
        }
        
        //countNodes() will count the nodes present in the list
        public int countNodes() {
            int count = 0;
            //Node current will point to head
            Node<T> current = head;
 
            while(current != null) {
                //Increment the count by 1 for each node
                count++;
                current = current.next;
            }
            return count;
        }
        
        //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;
            }
            Console.WriteLine("Nodes of singly linked list: ");
            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);
        
        //Displays the nodes present in the list
        sList.display();    
        
        //Counts the nodes present in the given list
        Console.WriteLine("Count of nodes present in the list: " + sList.countNodes());
    }
}

输出

Nodes of singly linked list: 
1 2 3 4 
Count of nodes present in the list: 4

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 CountNodes{
    //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;
        }
    }
    
    //countNodes() will count the nodes present in the list
    function countNodes() {
        $count = 0;
        //Node current will point to head
        $current = $this->head;
        
        while($current != NULL) {
            //Increment the count by 1 for each node
            $count++;
            $current = $current->next;
        }
        return $count;
    }    
    
    //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;
        }
        print("Nodes of singly linked list: <br>");
        while($current != NULL) {
            //Prints each node by incrementing pointer
            print($current->data . " ");
            $current = $current->next;
        }
        print("<br>");
    }
}
    
$sList = new CountNodes();
        
//Add nodes to the list
$sList->addNode(1);
$sList->addNode(2);
$sList->addNode(3);
$sList->addNode(4);
 
//Displays the nodes present in the list
$sList->display();
    
//Counts the nodes present in the given list
print("Count of nodes present in the list: " . $sList->countNodes());
?>
</body>
</html>

输出

Nodes of singly linked list: 
1 2 3 4 
Count of nodes present in the list: 4

下一主题#

创建包含 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）的程序

显示数字三角形图案（19）的程序

打印 1 到 100 之间的所有迪沙里数的程序

将二叉树转换为二叉搜索树的程序

编写查找正八面体（Octahedron）体积的程序

在单链表中搜索元素的程序

查找文本文件中出现次数最多的单词的程序

将小写字符转换为大写，并将大写字符转换为小写的程序

订阅 Tpoint Tech

联系信息

关注我们

教程

面试题

在线编译器