程序从单链表的中间删除一个新节点

→下一 ←上一页

解释

在这个程序中，我们将创建一个单链表，并从列表中间删除一个节点。为了完成这个任务，我们将计算列表的大小，然后将其除以2，得到列表的中点。节点温度将指向头节点。我们将遍历列表直到中间?到了。现在，temp将指向中间节点，节点current将指向temp之前的节点，我们删除中间节点，这样current的下一个节点将指向temp的下一个节点。

考虑上面的例子，上面列表的中点是2。从头部到中点迭代temp。现在，temp指向需要删除的中间节点。在此例中，“Node”为需要删除的中间节点。可以通过使节点2的next (current)指向节点3 (temp的下一个节点)来删除节点。将temp设置为null。

算法

创建一个类Node，它有两个属性:data和next。Next是指向列表中下一个节点的指针。
创建另一个类DeleteMid，它有三个属性:head、tail和size，用于跟踪列表中存在的节点数量。
addNode()将向列表中添加一个新节点:
1. 创建一个新节点。
2. 它首先检查，头是否等于空，这意味着列表是空的。
3. 如果列表为空，则头和尾都指向新添加的节点。
4. 如果列表不为空，则新节点将被添加到列表的末尾，这样tail的next将指向新添加的节点。这个新节点将成为列表的新尾部。
deleteFromMid()将从列表中间删除一个节点:
1. 它首先检查头部是否为空(空列表)，然后显示消息“列表为空”并返回。
2. 如果列表不为空，它将检查列表是否只有一个节点。
3. 如果列表只有一个节点，它将把头和尾都设置为空。
4. 如果列表有多个节点，那么计算列表的大小并将其除以2以获得列表的中点。
5. 声明一个节点temp，它将指向head，节点current将指向temp之前的节点。
6. 遍历列表，直到temp指向中间节点。如果current不指向null，那么通过使current的next指向temp的next来删除中间节点(temp)。否则，head和tail都将指向temp旁边的节点，并通过将temp设置为null来删除中间节点。
Display()将显示列表中存在的节点:
1. 定义一个节点电流，它将最初指向列表的头部。
2. 遍历列表，直到当前指向null。
3. 在每次迭代中，通过使current指向它旁边的节点来显示每个节点。

解决方案

Python

            表示单链表类node: def __init__(self,data): self的一个节点。Data =数据;自我。next =无;类DeleteMid: #表示单链表的头和尾def __init__(self): self。head =无;自我。tail =无;自我。Size = 0;#addNode()将添加一个新节点到列表def addNode(self, data): #创建一个新节点newNode = node (data);#检查列表是否为空。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; #Size will count the number of nodes present in the list self.size = self.size + 1; #deleteFromMid() will delete a node from the middle of the list def deleteFromMid(self): #Checks if list is empty if(self.head == None): print("List is empty"); return; else: #Store the mid position of the list count = (self.size//2) if(self.size % 2 == 0) else((self.size+1)//2); #Checks whether head is equal to tail or not, if yes then list has only one node. if( self.head != self.tail ): #Initially, temp will point to head temp = self.head; current = None; #Current will point to node previous to #If temp is pointing to node 2 then current will point to node 1. for i in range(0, count-1): current = temp; temp = temp.next; if(current != None): #temp is the middle that needs to be removed. #So, current node will point to node next to temp by skipping temp. current.next = temp.next; #Delete temp temp = None; #If current points to None then, head and tail will point to node next to temp. else: self.head = self.tail = temp.next; #Delete temp temp = None; #If the list contains only one element #then it will remove it and both head and tail will point to None else: self.head = self.tail = None; self.size = self.size - 1; #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), current = current.next; sList = DeleteMid(); #Adds data to the list sList.addNode(1); sList.addNode(2); sList.addNode(3); sList.addNode(4); #Printing original list print("Original List: "); sList.display(); while(sList.head != None): sList.deleteFromMid(); #Printing updated list print("Updated List: "); sList.display();
           

输出:

原始列表:1 2 3 4更新列表:1 3 4更新列表:1 4更新列表:4更新列表:列表为空

C

            #include <stdio.h> //表示单链表结构的节点node{int data;Struct node *next;};int大小;//表示单链表结构的头和尾节点*head， *tail = NULL;//addNode()将添加一个新的节点到列表void addNode(int data){//创建一个新的节点struct节点*newNode = (struct节点*)malloc(sizeof(struct节点));newNode->data = data;newNode->next = NULL;//检查列表是否为空if(head == NULL){//如果列表为空，头和尾都指向新节点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; } //Size will count the number of nodes present in the list size++; } //deleteFromMid() will delete a node from the middle of the list void deleteFromMid() { struct node *temp, *current; //Checks if list is empty if(head == NULL) { printf("List is empty \n"); return; } else { //Store the mid position of the list int count = (size % 2 == 0) ? (size/2) : ((size+1)/2); //Checks whether the head is equal to the tail or not, if yes then the list has only one node. if( head != tail ) { //Initially, temp will point to head temp = head; current = NULL; //Current will point to node previous to temp //If temp is pointing to node 2 then current will point to node 1. for(int i = 0; i < count-1; i++){ current = temp; temp = temp->next; } if(current != NULL) { //temp is the middle that needs to be removed. //So, current node will point to node next to temp by skipping temp. current->next = temp->next; //Delete temp temp = NULL; } //If current points to NULL then, head and tail will point to node next to temp. else { head = tail = temp->next; //Delete temp temp = NULL; } } //If the list contains only one element //then it will remove it and both head and tail will point to NULL else { head = tail = NULL; } } size--; } //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() { //Adds data to the list addNode(1); addNode(2); addNode(3); addNode(4); //Printing original list printf("Original List: \n"); display(); while(head != NULL) { deleteFromMid(); //Printing updated list printf("Updated List: \n"); display(); } return 0; }
           

输出:

原始列表:1 2 3 4更新列表:1 3 4更新列表:1 4更新列表:4更新列表:列表为空

JAVA

            #include <stdio.h> //表示单链表结构的节点node{int data;Struct node *next;};int大小;//表示单链表结构的头和尾节点*head， *tail = NULL;//addNode()将添加一个新的节点到列表void addNode(int data){//创建一个新的节点struct节点*newNode = (struct节点*)malloc(sizeof(struct节点));newNode->data = data;newNode->next = NULL;//检查列表是否为空if(head == NULL){//如果列表为空，头和尾都指向新节点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; } //Size will count the number of nodes present in the list size++; } //deleteFromMid() will delete a node from the middle of the list void deleteFromMid() { struct node *temp, *current; //Checks if list is empty if(head == NULL) { printf("List is empty \n"); return; } else { //Store the mid position of the list int count = (size % 2 == 0) ? (size/2) : ((size+1)/2); //Checks whether the head is equal to the tail or not, if yes then the list has only one node. if( head != tail ) { //Initially, temp will point to head temp = head; current = NULL; //Current will point to node previous to temp //If temp is pointing to node 2 then current will point to node 1. for(int i = 0; i < count-1; i++){ current = temp; temp = temp->next; } if(current != NULL) { //temp is the middle that needs to be removed. //So, current node will point to node next to temp by skipping temp. current->next = temp->next; //Delete temp temp = NULL; } //If current points to NULL then, head and tail will point to node next to temp. else { head = tail = temp->next; //Delete temp temp = NULL; } } //If the list contains only one element //then it will remove it and both head and tail will point to NULL else { head = tail = NULL; } } size--; } //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() { //Adds data to the list addNode(1); addNode(2); addNode(3); addNode(4); //Printing original list printf("Original List: \n"); display(); while(head != NULL) { deleteFromMid(); //Printing updated list printf("Updated List: \n"); display(); } return 0; }
           

输出:

原始列表:1 2 3 4更新列表:1 3 4更新列表:1 4更新列表:4更新列表:列表为空

c#

            使用系统;公共类CreateList{//表示一个节点的单链表公共类node <T>{公共T数据;public Node<T> next;public Node(T value) {data = value;Next = null;}}公共类DeleteMid<T>{公共int大小;//表示单链表的头和尾public Node<T> head = null;public Node<T> tail = null;//addNode()将添加一个新节点到列表public void addNode(T data){//创建一个新节点node <T> newNode =新节点<T>(data);//检查列表是否为空if(head == null){//如果列表为空，头和尾都指向新节点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; } //Size will count the number of nodes present in the list size++; } //deleteFromMid() will delete a node from the middle of the list public void deleteFromMid() { Node<T> temp, current; //Checks if list is empty if(head == null) { Console.WriteLine("List is empty"); return; } else { //Store the mid position of the list int count = (size % 2 == 0) ? (size/2) : ((size+1)/2); //Checks whether the head is equal to the tail or not, if yes then the list has only one node. if( head != tail ) { //Initially, temp will point to head temp = head; current = null; //Current will point to node previous to temp //If temp is pointing to node 2 then current will point to node 1. for(int i = 0; i < count-1; i++){ current = temp; temp = temp.next; } if(current != null) { //temp is the middle that needs to be removed. //So, current node will point to node next to temp by skipping temp. current.next = temp.next; //Delete temp temp = null; } //If current points to null then, head and tail will point to node next to temp. else { head = tail = temp.next; //Delete temp temp = null; } } //If the list contains only one element //then it will remove it and both head and tail will point to null else { head = tail = null; } } size--; } //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() { DeleteMid<int> sList = new DeleteMid<int>(); //Adds data to the list sList.addNode(1); sList.addNode(2); sList.addNode(3); sList.addNode(4); //Printing original list Console.WriteLine("Original List: "); sList.display(); while(sList.head != null) { sList.deleteFromMid(); //Printing updated list Console.WriteLine("Updated List: "); sList.display(); } } }
           

输出:

原始列表:1 2 3 4更新列表:1 3 4更新列表:1 4更新列表:4更新列表:列表为空

PHP

            < !DOCTYPE html> <html> <body> <?php //表示一个节点的单链表类node {public $data;公共美元未来;函数__construct($data){$this->data = $data;$this->next = NULL;}}类DeleteMid{//表示单链表public $head的头和尾;公共美元尾;函数__construct(){$this->head = NULL;$this->tail = NULL; $this->size = 0; } //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; } //Size will count the number of nodes present in the list $this->size++; } //deleteFromMid() will delete a node from the middle of the list function deleteFromMid() { //Checks if list is empty if($this->head == null) { print("List is empty <br>"); return; } else { //Store the mid position of the list $count = ($this->size % 2 == 0) ? ($this->size/2) : (($this->size+1)/2); //Checks whether head is equal to tail or not, if yes then list has only one node. if( $this->head != $this->tail ) { //Initially, temp will point to head $temp = $this->head; $current = null; //Current will point to node previous to temp //If temp is pointing to node 2 then current will point to node 1. for($i = 0; $i < $count-1; $i++){ $current = $temp; $temp = $temp->next; } if($current != null) { //temp is the middle that needs to be removed. //So, current node will point to node next to temp by skipping temp. $current->next = $temp->next; //Delete temp $temp = null; } //If current points to null then, head and tail will point to node next to temp. else { $this->head = $this->tail = $temp->next; //Delete temp $temp = null; } } //If the list contains only one element //then it will remove it and both head and tail will point to null else { $this->head = $this->tail = null; } } $this->size--; } //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 DeleteMid(); //Adds data to the list $sList->addNode(1); $sList->addNode(2); $sList->addNode(3); $sList->addNode(4); //Printing original list print("Original List: <br>"); $sList->display(); while($sList->head != null) { $sList->deleteFromMid(); //Printing updated list print("Updated List: <br>"); $sList->display(); } ?> <div style="text-align:center;margin-bottom:5px;"><form action="http://www.baidu.com/baidu" target="_blank"><div bgcolor="#FFFFFF" style="text-align:center;"><input name="tn" type="hidden" value="baidu"><a href="http://www.baidu.com/"><img src="http://img.baidu.com/img/logo-80px.gif" width="80px" height="29px" alt="Baidu" align="bottom" border="0"></a><input type="text" name="word" size="30" placeholder="" value=""><input type="submit" value="baidu"></div></form></div><div id="so360" style="text-align:center;margin-bottom:5px;"><form action="https://www.so.com/" target="_blank" id="so360form"><img src="http://p1.qhimg.com/d/_onebox/search.png" width="100px" height="25px"> <input type="text" autocomplete="off" name="q" id="so360_keyword" placeholder="" value="">  <input type="submit" id="so360_submit" value="360"> <input type="hidden" name="ie" value="gbk"><input type="hidden" name="src" value="zz"> <input type="hidden" name="site" value="so.com"> <input type="hidden" name="rg" value="1"></form></div><div id="sogou" style="text-align:center;margin-bottom:5px;"><form action="https://www.sogou.com/" target="_blank" id="so360form"><img src="https://www.sogou.com/web/index/images/logo_440x140.v.4.png" width="100px" height="25px"> <input type="text" autocomplete="off" name="q" id="sogou.com_keyword" placeholder="" value="">  <input type="submit" id="sogou_submit" value="sougou"> <input type="hidden" name="ie" value="gbk"><input type="hidden" name="src" value="zz"> <input type="hidden" name="site" value="so.com"> <input type="hidden" name="rg" value="1"></form></div><div align="center"><a target="_blank" href="/sitemap.xml">map</a></div></body> </html>
           

输出:

原始列表:1 2 3 4更新列表:1 3 4更新列表:1 4更新列表:4更新列表:列表为空

下一个话题＃

←上一页下一个→

视频加入我们的Youtube频道:现在加入

反馈

将你的意见发送至(电子邮件保护)

帮助别人，请分享

学习最新教程

Splunk

SPSS

2022世界杯赛程安排

transact - sql

Tumblr

ReactJS

正则表达式

强化学习

世界杯2022赛程时间表最新

RxJS

反应本地

Python设计模式

Python的枕头

Python的乌龟

Keras

准备

资质

世界杯2022赛程时间表

语言能力

面试问题

公司的问题

b .技术/马华

2022世界杯预选赛

数据结构

DAA

操作系统

计算机网络

编译器设计

计算机组织

离散数学

道德黑客

计算机图形学

软件工程

网络技术

网络安全

自动机

C编程

c++

Java

net

Python

项目

控制系统

数据挖掘

数据仓库

2022世+D11837:D11850界杯八强让球

JavaTpoint提供了太多高质量的服务。邮件地址:(电子邮件保护)，以获取有关特定服务的更多信息。

网站设计
网站开发
世界杯欧洲杯小组赛
PHP开发
WordPress
平面设计
标志
2022卡塔尔世界杯赛程图
页面上和页面外的SEO
PPC
内容开发
企业培训
课堂和在线培训
数据输入

大学校园培训

JavaTpoint提供核心Java、高级Java、。net、Android、Hadoop、PHP、Web技术和Python的大学校园培训。请将您的要求寄至(电子邮件保护)
持续时间:1 - 2周

^{喜欢/订阅我们以获取最新更新或通讯}

项目