问。在循环链表的开头插入新节点的程序。

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

说明

在本程序中，我们将创建一个循环链表，并将每个新节点插入到链表的开头。如果链表为空，则 head 和 tail 都将指向新添加的节点。如果链表不为空，我们将把 head 的数据存储在一个临时节点 temp 中，并将新节点设为 head。这个新的 head 将指向临时节点。简单来说，新添加的节点将成为第一个节点（head），而之前的 head（temp）将成为链表的第二个节点。

Program to insert a new node at the beginning of the circular linked list

在列表开头插入新节点后

New 代表新添加的节点。之前 A 是链表的 head。当 New 被添加到链表开头时，New 将成为新的 head，并指向之前的 head，即 A。

算法

定义一个 Node 类，它表示列表中的一个节点。它有两个属性 data 和 next，next 将指向下一个节点。
定义另一个类来创建循环链表，它有两个节点：head 和 tail。它有两个方法：addAtStart() 和 display() 。
addAtStart() 将节点添加到链表开头。
1. 它首先检查 head 是否为 null（空列表），然后它将节点插入为 head。
2. head 和 tail 都将指向新添加的节点。
3. 如果列表不为空，则新添加的节点将成为新的头节点，它将指向之前的头节点。
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 at the start of the list.
  def addAtStart(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:
        #Store data into temporary node
        temp = self.head;
        #New node will point to temp as next node
        newNode.next = temp;
        #New node will be the head node
        self.head = 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("Adding nodes to the start of the list: ");
        #Prints each node by incrementing pointer.
        print(current.data),
        while(current.next != self.head):
            current = current.next;
            print(current.data),
        print("\n");
 
class CircularLinkedList:
  cl = CreateList();
  
  #Adding 1 to the list
  cl.addAtStart(1);
  cl.display();
  #Adding 2 to the list
  cl.addAtStart(2);
  cl.display();
  #Adding 3 to the list
  cl.addAtStart(3);
  cl.display();
  #Adding 4 to the list
  cl.addAtStart(4);
  cl.display();

输出

Adding nodes to the start of the list: 
1
Adding nodes to the start of the list: 
2 1
Adding nodes to the start of the list: 
3 2 1
Adding nodes to the start of the list: 
4 3 2 1

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 to the start of the list.
void addAtStart(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 {
        //Store data into temporary node
        struct node *temp = head;
        //New node will point to temp as next node
        newNode->next = temp;
        //New node will be the head node
        head = 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("Adding nodes to the start of the list: \n");
         do{
             //Prints each node by incrementing pointer.
            printf("%d ", current->data);
            current = current->next;
        }while(current != head);
        printf("\n");
    }
}
    
int main()
{
   //Adding 1 to the list
   addAtStart(1);
   display();
   //Adding 2 to the list
   addAtStart(2);
   display();
   //Adding 3 to the list
   addAtStart(3);
   display();
   //Adding 4 to the list
   addAtStart(4);
   display();
   
   return 0;
}

输出

Adding nodes to the start of the list: 
1
Adding nodes to the start of the list: 
2 1
Adding nodes to the start of the list: 
3 2 1
Adding nodes to the start of the list: 
4 3 2 1

JAVA

public class InsertAtStart {
    //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 addAtStart(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 {
                //Store data into temporary node
                Node temp = head;
                //New node will point to temp as next node
                newNode.next = temp;
                //New node will be the head node
                head = 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("Adding nodes to the start of the 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) {
            InsertAtStart cl = new InsertAtStart();
            
            //Adding 1 to the list
            cl.addAtStart(1);
            cl.display();
            //Adding 2 to the list
            cl.addAtStart(2);
            cl.display();
            //Adding 3 to the list
            cl.addAtStart(3);
            cl.display();
            //Adding 4 to the list
            cl.addAtStart(4);
            cl.display();
        }
}

输出

Adding nodes to the start of the list: 
1
Adding nodes to the start of the list: 
2 1
Adding nodes to the start of the list: 
3 2 1
Adding nodes to the start of the list: 
4 3 2 1

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 to the start of the list.
            public void addAtStart(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{
                    
                    //Store data into temporary node
                    Node<T> temp = head;
                    //New node will point to temp as next node
                    newNode.next = temp;
                    //New node will be the head node
                    head = 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 = head;
                if(head == null){
                    Console.WriteLine("List is empty");
                }
                else{
                    Console.WriteLine("Adding nodes to the start of the list: ");
                    do{
                        //Prints each node by incrementing pointer.
                        Console.Write(" "+ current.data);
                        current = current.next;
                }while(current != head);
                    
                Console.WriteLine();
                }    
            }
        }
        
        public static void Main()
        {
            
        CreateList<int> cl = new CreateList<int>();
            
        //Adding 1 to the list
        cl.addAtStart(1);
        cl.display();
        //Adding 2 to the list
        cl.addAtStart(2);
        cl.display();
        //Adding 3 to the list
        cl.addAtStart(3);
        cl.display();
        //Adding 4 to the list
        cl.addAtStart(4);
        cl.display();
        
        }    
    }
}           

输出

 Adding nodes to the start of the list: 
1
Adding nodes to the start of the list: 
2 1
Adding nodes to the start of the list: 
3 2 1
Adding nodes to the start of the list: 
4 3 2 1

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 start of the list.
    function addAtStart($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{
            //Store data into temporary node
            $temp = $this->head;
            //New node will point to temp as next node
            $newNode->next = $temp;
            //New node will be the head node
            $this->head = $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 "Adding nodes to the start of the list: <br>";
             do{
                echo(" $current->data");
                $current = $current->next;
            }while($current != $this->head);
            echo "<br>";
        }
    }   
}
$cl = new CreateList();
//Adding 1 to the list
$cl->addAtStart(1);
$cl->display();
//Adding 2 to the list
$cl->addAtStart(2);
$cl->display();
//Adding 3 to the list
$cl->addAtStart(3);
$cl->display();
//Adding 4 to the list
$cl->addAtStart(4);
$cl->display();
?>
</body>
</html>

输出

Adding nodes to the start of the list: 
1
Adding nodes to the start of the list: 
2 1
Adding nodes to the start of the list: 
3 2 1
Adding nodes to the start of the list: 
4 3 2 1

下一主题#

问。在循环链表的开头插入新节点的程序。

说明

算法

解决方案

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 之间的所有普罗尼克数（Pronic number）的程序

查找字符串中重复单词的程序

将英寸转换为厘米的程序

创建包含 N 个节点的循环链表并以反向顺序显示的程序

查找字符频率的程序

从双向链表中删除重复元素的程序

将天数转换为年的程序

从双向链表开头删除新节点的程序

计算等边三角形面积的程序

订阅 Tpoint Tech

联系信息

关注我们

教程

面试题

在线编译器